Fujitsu Corporation

Masakazu Hayashi

Yutaka Igarashi

Yuji Watanabe

KohIchiro Hotta

Yukihiro Kimura

Manabu Matsuyama

Tadashi Nakahira

Masatoshi Haraguchi

Masafumi Hashiguchi

Katsutomo Sekiguchi

Kaname Mita

Masaaki Takiuchi

Kohichiro Hotta

Kenji Kazumura

Hidetoshi Hattori

A recovery virtual machine acquires execution frequency information from a file, and converts a procedure, of which execution frequency is high in the execution frequency information acquired, to native code, and the time for starting the conversion is thereby reduced. Furthermore, by performing conversion at a timing at which a target procedure is invoked, load occurring due to the conversion is distributed, to prevent occurrence of failure in execution of an application caused by the load occurring due to the conversion.

Compile timing based on execution frequency of a procedure

Measurement/analysis unit in a Java virtual machine has the function of measuring data when an event of garbage collection occurs, and the function of periodically measuring data. The measurement/analysis unit analyzes the measured data and predicts a danger of a memory shortage, and predicts a danger using an algorithm depending on the type of garbage collection used by the Java virtual machine. An application server is notified of a warning of the predicted danger of a memory shortage by an analysis result notification means by an inter-process communication, or the like. The measurement/analysis unit calculates a memory capacity required to avoid the predicted danger of a memory shortage, and the calculated memory capacity is transmitted to the application server by the analysis result notification means by an inter-process communication, or the like in the same way as the warning.

Method for predicting and avoiding danger in execution environment

An apparatus for facilitating optimization processing in a compiler includes a language-specific-rule table which stores one or more predetermined rules which are specified for one or more programming languages; an analyzing unit which analyzes a program code which includes one or more instructions, and is described in one of the one or more programming languages, based on the one or more predetermined rules, to obtain an analysis result; and an embedding unit which embeds the analysis result in the program code.

Method and apparatus for analyzing program based on rules of programming language before optimization in compiler

When an encoded source file is inputted to a compiler, the compiler decodes the encoded source file in certain units and partially restores the original source data. Then, the restored part is converted to an intermediate text in restored order, and an executable program is created from the intermediate text.

Apparatus and method for translating with decoding function

A compile processing apparatus compiles a program formed of a plurality of classes having initializing procedures. The compile processing apparatus includes a specifying unit for specifying an initializing procedure when a statement to be compiled requires the initializing procedure, a determination unit for executing a determination process for determining whether the initializing procedure specified by the specifying unit can be considered to not affect other classes, and a changing unit for changing the statement so that the statement does not access the initializing procedure when the determination unit determines that the initializing procedure can be considered to not affect the other classes.

Compile processing apparatus and method and program executing apparatus and method

A compiling system includes a first unit for converting a source program into an intermediate text formed of intermediate codes, each of the intermediate codes having a portion used to explicitly indicate information regarding a state of computer hardware, the computer hardware being operated in accordance with a machine language program, and a second unit for generating a machine language program using the intermediate codes of the intermediate text. In addition, a compiling system includes a first unit for converting a source program into an intermediate text formed of intermediate codes, each of the intermediate codes having a portion used to define a plurality of values, and a second unit for generating a machine language program using the intermediate codes of the intermediate text.

Compiling system using intermediate codes to store a plurality of values

A compiling processing apparatus which compiles a program operating in a computer having a cache memory. This apparatus collects memory access data for the cache memory, analyzes confliction relationships between them, determines whether or not an instruction for confliction memory access data relocates, relocates the instruction if relocation is possible, and reduces the number of cache miss. Further, this apparatus recognizes memory access data in a continuous area, audits recognized memory access data alignment, generates an instruction of pair-load/pair-store, and reduces the number of memory accesses.

Compiling processing apparatus

A compiling apparatus and method in which instructions are scheduled for an efficient parallel process with a register allotting process and an instruction scheduling process performed independently of each other. An instruction scheduling unit collects information indicating the range of available registers, and renames registers by replacing the register numbers used by the instructions with other register numbers according to the collected register information and the analysis of definition/reference instruction dependency. The instructions are scheduled after the registers have been renamed.

Compiling apparatus and method for promoting an optimization effect of a

When a flow graph is created for a program including a complex if statement, the respective branch conditions in the complex if statement are separated and the flow graph designating the control flow corresponding to the logical value of respective branch conditions are created. Next, to perform the branch probability determining/allocating process, in the above flow graph, the value corresponding to the number of executions of respective paths is calculated so that the whole branch probability of the complex if statement designated by the optimization designating statement and the branch probability of respective branch conditions is assigned to the path corresponding to respective branch conditions.

Method of performing a compilation process for determining a branch

An object of the present invention is to realize a compiling apparatus producing an object program which can be executed at a high speed. In a compiling apparatus according to the present invention, an aliasing address comparison instruction generating unit inserts a instruction to compare the two memory addresses of each pair of data expressions whose overlap is judged to be obscure, generates a plurality of paths defined by combinations of conditions whether or not memory addresses of data expressions of each pair overlap, and generates a instruction to branch to one of the paths according to a comparison result obtained by the instruction in an execution of a compiled program, and an optimization unit for respectively optimizing the paths. When the object program is executed, one path corresponding to a practical condition is selected from the plurality of paths, and only the selected path is executed.

Compiling apparatus having a function to analyze overlaps of memory

A compiling apparatus has a front end for providing intermediate representations according to a source program; an optimizing unit for optimizing the intermediate representations; an intermediate representation changing unit for changing the optimized intermediate representations; and a code output unit for providing code according to the lastly obtained intermediate representations. The compiling apparatus further has an optimizing structure determination unit for determining the number of repetitions of an optimization phase achieved by the optimizing unit and intermediate representation changing unit and selecting optimization functions carried out in each of the optimization phases. The intermediate representations are changed and optimized in each optimization phase according to the determination by the optimizing structure determination unit.

Growing community of inventors

Kawasaki, Japan

Masakazu Hayashi