WO2002077802A1 - Function executing method, function executing device, computer program and recording medium - Google Patents
Function executing method, function executing device, computer program and recording medium Download PDFInfo
- Publication number
- WO2002077802A1 WO2002077802A1 PCT/JP2002/002888 JP0202888W WO02077802A1 WO 2002077802 A1 WO2002077802 A1 WO 2002077802A1 JP 0202888 W JP0202888 W JP 0202888W WO 02077802 A1 WO02077802 A1 WO 02077802A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- function
- called
- call
- recording area
- area
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Ceased
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/448—Execution paradigms, e.g. implementations of programming paradigms
- G06F9/4482—Procedural
- G06F9/4484—Executing subprograms
Definitions
- a function recording area based on a format of a called function called from a calling function including a process of calling another function is stacked in a stack area in a memory, and the stacking of the function recording area is performed using the stacked function recording area.
- the present invention relates to a function execution method, a function execution device, a computer program, and a recording medium for executing a function described in an object-oriented language such as a Java language in a JVM (Java Virtual Machine).
- a function execution method for executing a program including a plurality of functions composed of a plurality of instructions described in an object-oriented language such as the Java language has been used for various purposes.
- a language is typically compiled into JVM bytecode and then executed in an area in the JVM's memory.
- FIG. 1 is a conceptual diagram showing a function recording area for recording functions necessary for executing a program.
- FIG. 1 (a), (b) and (c) show As described above, the functions necessary for the processing of the program call the called function to be executed from the executing call function, and store the function record area of the executing call function secured in the stack area of the memory (file ), A new function recording area based on the format of the called function is secured in a stacked form, the called function is executed using the secured function recording area, and after the execution of the called function is completed. , Discard the stacked function storage area that is no longer needed.
- the function recording area that records the function that is being executed at the top is called the top frame.
- function F is being executed, and the function recording area of function F is It becomes a top frame.
- FIG. 1 (b) when function G is the calling function and another called function H is called, as shown in FIG. 1 (c), the function H is The function recording area for execution is stacked in the stack area to become the top frame.After the execution of function H is completed, the execution result of function H is passed to function G, and the function recording area is discarded and called. The state shown in Fig. 1 (b) is obtained.
- stacking a large number of function recording areas in the stack area causes a situation in which the stack area overflows, and in some cases, hinders program execution. There is.
- the present invention has been made in view of such circumstances, and when it is determined that a call by a call function is a tail call, the call function is recorded without stacking a new function recording area.
- the function recording area as a function recording area for recording the called function, it is possible to reduce the possibility that the function recording area overflows the stack area and hinder the program execution.
- Function execution method for reducing the processing load required for the above and improving the overall execution speed, a function execution device to which the method is applied, a computer program for realizing the device, and a recording medium on which the computer program is recorded The main purpose is to provide
- Another object of the present invention is to provide a method for executing a function that does not require a special instruction to be added to a compiler that converts the function into an executable function such as.
- Another object is to provide a function execution method and the like capable of optimizing a recording area. Disclosure of the invention
- a function recording area based on a format of a called function called from a calling function including a process of calling another function is stacked in a stack area in a memory, and the stacked function recording is performed.
- the function execution method of calling the called function using the area executing the called function, and discarding the stacked function recording area, analyzing the calling function executed in the function recording area, When it is determined from the analysis that the call function satisfies a predetermined condition, the function recording area for executing the call function is used as an area for calling the called function.
- the function recording area of the call function is reused as the recording area of the called function, and the function stored in the stack area is used.
- a function recording area based on a format of a called function called by executing a calling function including a process of calling another function in a stack area in the memory.
- the called function is called by using the stacked function recording area, and the called
- the function execution method for discarding the accumulated function recording area after executing the output function the execution form of the first call function executed in the function recording area is analyzed, and the first call function is determined by the analysis. If it is determined that the above condition is satisfied, a second call function different from the first including a process of using a function recording area for executing the call function as an area for calling the called function is used as the first call function. Execute as an alternative function of.
- the second call function which is a newly prepared function including the process of reusing the used function record area as the record area of the called function, is called a substitute function of the first call function.
- the second call function which is a newly prepared function including the process of reusing the used function record area as the record area of the called function, is called a substitute function of the first call function.
- the above-described processing is described in a language such as Java language.
- Source code This is performed when executing the first call function of the executable form such as byte code obtained by the filter, so no special consideration is required when creating the source code, and the source code is converted. There is no need to add special instructions to the compiler.
- the predetermined condition is that an execution result of the called function is an execution result of the called function.
- the function recording area of the call function is re-recorded as the record area of the called function.
- a function execution method is the method according to any one of the first invention to the third invention, wherein the function recording area is changed based on a format of the called function when the called function and the called function are different. I do.
- the function recording area reserved for the called function is changed based on the format of the called function, whereby the called function is changed.
- the function can be executed without any problem in the function recording area where the called function is reused, and when the calling function and the called function are the same function, the function can be reused without changing the format of the function recording area Therefore, it is possible to eliminate the processing required for changing the format and to improve the overall processing speed.
- the function execution device has a function recording area based on the format of the called function called from the calling function including the processing for calling another function in the stack area in the memory, and stacks the function recording area.
- the called function is called using the function recording area, and after executing the called function, the function execution unit that destroys the stacked function recording area analyzes the called function executed in the function recording area.
- the call by the call function is If it is determined that a predetermined condition such as a tail call whose execution result is the execution result of the calling function is satisfied, the function recording area of the calling function is reused as the recording area of the called function, and By reducing the number of function recording areas stacked in the stack area, it is possible to reduce the possibility that the function recording area overflows the stack area and hinders the execution of the program. The processing load required for stacking and discarding can be reduced, and the overall execution speed can be improved.
- a function execution device provides a function recording area based on a format of a called function called by executing a calling function including a process of calling another function in a stack area in the memory.
- Means for analyzing the execution form of the first call function, and a function recording area for executing the call function when the first call function satisfies a predetermined condition by the analysis Means for executing, as an alternative function of the first call function, a second call function different from the first including a process for using the call function as a call area.
- the function execution device when it is determined that the call by the first call function satisfies a predetermined condition, such as a tail call whose execution result of the called function is the execution result of the call function, the second call function, which is a newly prepared function including the process of reusing the used function recording area as the recording area of the called function, is assumed to be a substitute function of the first call function. And reduce the number of function recording areas that are stacked in the stack area, thus reducing the possibility that the function recording area will overflow the stack area and interfere with program execution. And again The processing load required for stacking and discarding function recording areas can be reduced, and the overall execution speed can be improved.
- a predetermined condition such as a tail call whose execution result of the called function is the execution result of the call function
- processing can be performed using source code written in a language such as the Java language. This is performed when executing the first call function of the executable form such as byte code obtained by compiling the source code.Therefore, no special consideration is required when creating the source code. There is no need to add special instructions to the converting compiler.
- a computer program causes a computer to stack, in a stack area in a memory, a function recording area based on a format of a called function called from a calling function including a process of calling another function.
- the computer program that causes the called function to be called using the function recording area that has been set, and after the called function has been executed, the accumulated function recording area is discarded, the computer calls the function executed in the function recording area.
- the function recording area for executing the call function when the computer determines that the call function satisfies a predetermined condition by analyzing the function and the computer is defined as an area for calling the called function. And a procedure for using the information.
- the execution function is executed by a JVM using a processing device such as a mobile phone or a personal computer, so that the JVM operates as a function execution device.
- a processing device such as a mobile phone or a personal computer
- the function recording area of the called function is reused as the recording area of the called function, and the number of function recording areas stacked in the stack area is reduced, so that the function recording area is stacked. It is possible to improve the overall execution speed by reducing the possibility of overflowing the area and hindering program execution, and reducing the processing load required for stacking and destroying the function recording area. is there.
- a computer program provides a function recording area based on a form of a called function called by executing a calling function including a process of calling another function in a stack area in a memory in a computer.
- the computer records the function.
- a second call function different from the first call function including a process for using the function recording area as an area for calling the called function is called the first call function. And a procedure to be executed as an alternative function.
- the computer program is executed by a JVM using a processing device such as a mobile phone and a personal computer, so that the JVM operates as a function execution device. If it is determined that the call satisfies a predetermined condition such as a tail call in which the execution result of the called function is the execution result of the called function, the used function recording area is re-recorded as the recording area of the called function. Executes the second call function, which is a newly prepared function including the processing to be used, as a substitute function of the first call function, and records the function that is stacked in the stack area.
- a predetermined condition such as a tail call in which the execution result of the called function is the execution result of the called function
- the above-described processing can be performed by compiling source code written in a language such as Java language or the like.
- the first of the executable Since it is performed when the calling function is executed, no special consideration is required when creating the source code, and no special instructions need to be added to the compiler that converts the source code.
- the computer program according to a ninth invention is based on the seventh invention or the eighth invention, wherein the predetermined condition is that an execution result of the called function is an execution result of the calling function.
- the call by the call function is a tail call, that is, the execution result of the call function is the execution result of the call function, and after the execution of the call function is completed, the function recording area of the call function is completed. Then, if the function record area of the called function is also a discarded call, a problem may occur with the function record area of the called function as the function record area of the called function. It can be reused without the need.
- a computer program according to a tenth aspect of the present invention is the computer program according to any one of the seventh to ninth aspects, wherein the function recording area is changed based on a format of the called function when the called function and the called function are different.
- the function recording area reserved for the calling function is changed based on the format of the called function.
- the function can be executed without any problem in the function recording area where the called function is reused.
- the computer-readable recording medium is a computer-readable storage medium that calls another function in a stack area in memory. Function storage area based on the format of the called function called from the calling function that includes the function, the called function is called using the stacked function recording area, and after the called function is executed, stacking is performed. On a computer-readable recording medium on which a computer program for discarding the function recording area is recorded, wherein the computer causes the computer to analyze the call function executed in the function recording area. And a step of, when it is determined by analysis that the calling function satisfies a predetermined condition, using the function recording area for executing the calling function as an area for calling the called function. Program is recorded.
- the recorded computer program is executed by a JVM using a processing device such as a mobile phone or a personal computer, so that the JVM functions as a function execution device.
- a processing device such as a mobile phone or a personal computer
- the JVM functions as a function execution device.
- the function recording area of the called function is reused as the recording area of the called function, and the function recording area is stacked on the stack area.
- the computer-readable recording medium is a computer-readable recording medium that is called by executing a call function including a process of calling another function in a stack area in a memory.
- a computer program that stacks the function recording area based on the function format, calls the called function using the stacked function recording area, and discards the stacked function recording area after executing the called function.
- a computer program including a procedure for executing the function as an alternative to the first calling function.
- the recorded computer program is executed by a JVM using a processing device such as a mobile phone or a personal computer, so that the JVM functions as a function execution device. If the call by the first call function satisfies a predetermined condition, such as a tail call where the execution result of the called function is the execution result of the call function, it is determined that Executing the second call function, which is a newly prepared function including the process of reusing the used function recording area as the callee function recording area, as an alternative function to the first call function This reduces the number of function recording areas that can be stacked in the stack area, and reduces the possibility that the function recording area overflows the stack area and hinders program execution.
- a predetermined condition such as a tail call where the execution result of the called function is the execution result of the call function
- FIG. 1 is a conceptual diagram showing a function recording area for recording functions necessary for executing a program
- FIG. 2 is a block diagram showing a function execution device of the present invention
- FIG. 3 is a diagram showing a function execution method of the present invention.
- FIG. 4 is a conceptual diagram
- FIG. 4 is a flowchart showing analysis processing in the function execution method of the present invention
- FIG. 5 is a flowchart showing execution processing in the function execution method of the present invention
- FIG. FIG. 7 is a flowchart showing execution processing in the function execution method of the present invention.
- FIG. 7 is a graph showing the processing speed of the function execution method of the present invention and the conventional function execution method.
- FIG. 2 is a block diagram showing a function execution device according to the present invention.
- reference numeral 10 denotes a function execution device of the present invention using a processing device such as a mobile phone or a personal computer.
- Function execution device 10 is a computer program PG for the function execution device of the present invention and information such as data.
- Storage means 12 to read information such as computer programs PG and data from recording media REC such as CD-ROM and memory card on which data is recorded.
- Computer programs PG and data read by auxiliary storage means 12.
- recording means 13 for recording information such as a hard disk, and memory means 14 for temporarily recording various information.
- the function execution device 10 includes a communication means 15 such as a modem, a TA (Terminal Adapter), and an antenna, and is connected to a communication network NW such as the Internet by the communication means 15.
- Information such as the computer program PG of the present invention and data recorded on the recording medium 21 provided in the recording device 20 such as a web server computer connected to the communication network NW may be executed. Les ,. Next, processing contents of the function execution method of the present invention will be described.
- the function execution method of the present invention is obtained by compiling source code written in a language such as Java into an execution format such as a byte code of a JVM using a general-purpose compiler.
- the present invention is applied to a method of executing a program including a plurality of functions composed of a plurality of instructions.
- the stack area in the memory means 14 includes the number of arguments for the function to be executed and the local variable area.
- a function execution method is based on stacking function recording areas based on the format such as the size of a function, and calling and executing functions in the stacked function recording areas.
- FIG. 3 is an explanatory view conceptually showing the function execution method of the present invention.
- Fig. 3 (a) shows the state in which the executable function F is executed in the function recording area secured in the stack function area.
- the execution result of the function H is related.
- the tail call results in the execution of the number G, as shown in Fig. 3 (c)
- the function record in which the function G is recorded without a new function recording area for the function H is accumulated.
- the area is a function recording area for calling function H.
- a new function recording area is first secured, and the functions to be called are called functions such as invo Kestatic ;, invokevirtual ⁇ invokesecia1, and invokeinterface.
- the calling function includes an instruction to be called, the execution format of the calling function is analyzed (S101), and the analysis indicates that the execution result of the called function is the execution result of the calling function. If it is determined that the function is the last call function that satisfies the condition (S102: Y), it is further determined whether the call function and the called function are the same (S103). ).
- step S103 if the called function and the called function are different, When it is determined (S103: N), a recursive alternative function (second call function) in which the call function (first call function) is replaced with an instruction that prepares an instruction to call the called function in advance is prepared. ) (S104). When it is determined that the called function and the called function are the same (S103: Y), an instruction to call the called function (first calling function) that is the same as the calling function is prepared in advance. Replace with the self-recursive alternative function (second calling function) that has been replaced with the alternative instruction being used (S105).
- Step S 1 0 2 when it is judged not to be the last call function (S 1 0 2: N) , Step S 1 0 3 ⁇ S 1 0 5 is processing performed such Rere 0
- step S104 As the recursive alternative function shown in step S104 and the self-recursive alternative function shown in step S105 used as an alternative function of the calling function, a function including the following new instructions is prepared. Keep it.
- FIGS. 5 and 6 are flowcharts showing execution processing in the function execution method of the present invention.
- the called function is called from the recursive alternative function (second calling function) that is being executed as the calling function (first calling function) by processing using an alternative instruction such as tailinvokestatic included in the alternative function.
- the function recording area where the recursive substitution function was executed is changed based on the format of the called function without adding a new function recording area.
- Update (S205) use the function recording area with the changed format as the area to call the called function (S206), call the called function (S207), and call
- the called function is executed (S208), and after executing the called function, the function recording area used for executing the called function is discarded (S209).
- step S201 If it is determined in step S201 that the function is a self-recursive alternative function (S201: 2), a function recording area based on the format of the self-recursive alternative function (second calling function) is accumulated (S2 1 0), call the self-recursive alternative function using the accumulated function recording area (S 2 1 1), and execute the self-recursive alternative function in the function recording area accumulated in step 210 (S 2 1 2).
- the self-recursive alternative function included in the self-recursive alternative function is used to execute the self-recursive alternative function (second call function) executed as the call function (first call function).
- second call function the function recording area where the self-recursive alternative function was executed is used as the area to call the called function without stacking up a new function recording area (S 21). 3), call the called function (S2 14), execute the called function (S2 15), and after executing the called function, discard the function recording area used for executing the called function Yes (S2 16).
- step S201 If it is determined in step S201 that the function is not a substitute function (S201: 3), the function recording area based on the form of the calling function is accumulated (S2177), and the accumulated function recording area is used. The calling function is called (S218), and the calling function is executed in the function recording area accumulated in step 217 (S219).
- the horizontal axis shows the call depth of the tail calling function
- the vertical axis shows the processing time in units of microseconds (us).
- Each time a call function is called the function record area is accumulated.
- the relationship between the call depth and the processing time by the conventional execution method is shown.
- the seal mark reuses the function record area when the call function is the tail call.
- the processing time of the function execution method of the present invention is shorter than that of the conventional function execution method, and the tendency is particularly remarkable in the self-tail calling function.
- JIT Just In Time Compiler
- the byte code of the JVM is converted into a machine language by the JIT technology.
- the speed of the execution process can be improved.
- the calling function is tail-call or self-tail-call.
- the alternative function is used.However, the present invention is not limited to this.Tail recursion is determined each time the function is executed, and tail recursion is performed when it is determined that tail recursion is performed. You may do it. Industrial applicability
- a mobile phone and a personal computer execute a program described in a language such as Java language and including a plurality of functions.
- a processing device such as the above
- the process of calling another function in the stack area in memory is called by the call function, and the execution result of the called function is the execution result of the called function.
- the function recording area of the called function is reused as the recording area of the called function, and the function recording area of the function recording area stacked in the stack area is reused. Reducing the number reduces the possibility that the function recording area overflows the stack area and hinders the execution of the program.
- the calling function and the called function are different, By changing the function recording area reserved for the function based on the format of the called function, it is possible to execute the function in the function recording area that reuses the called function without any problem.
- the called function and the called function are the same function, they are reused without changing the format of the function recording area, thus eliminating the processing required to change the format and improving the overall processing speed. It has excellent effects, such as being able to cause
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Devices For Executing Special Programs (AREA)
- Executing Machine-Instructions (AREA)
Description
Claims
Priority Applications (3)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| EP02705496A EP1383044A1 (en) | 2001-03-26 | 2002-03-25 | Function executing method, function executing device, computer program and recording medium |
| JP2002575788A JP3785596B2 (ja) | 2001-03-26 | 2002-03-25 | 関数実行方法、関数実行装置、コンピュータプログラム、及び記録媒体 |
| US10/628,133 US7130972B2 (en) | 2001-03-26 | 2003-07-25 | Function execution method, function execution apparatus, computer program and recorded medium |
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP2001088850 | 2001-03-26 | ||
| JP2001-88850 | 2001-03-26 |
Related Child Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| US10/628,133 Continuation US7130972B2 (en) | 2001-03-26 | 2003-07-25 | Function execution method, function execution apparatus, computer program and recorded medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2002077802A1 true WO2002077802A1 (en) | 2002-10-03 |
Family
ID=18943875
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/JP2002/002888 Ceased WO2002077802A1 (en) | 2001-03-26 | 2002-03-25 | Function executing method, function executing device, computer program and recording medium |
Country Status (4)
| Country | Link |
|---|---|
| US (1) | US7130972B2 (ja) |
| EP (1) | EP1383044A1 (ja) |
| JP (1) | JP3785596B2 (ja) |
| WO (1) | WO2002077802A1 (ja) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7610474B2 (en) * | 2005-12-01 | 2009-10-27 | Sun Microsystems, Inc. | Mechanism for hardware tracking of return address after tail call elimination of return-type instruction |
| US7836290B2 (en) * | 2005-11-09 | 2010-11-16 | Oracle America, Inc. | Return address stack recovery in a speculative execution computing apparatus |
| US8250551B2 (en) * | 2008-01-17 | 2012-08-21 | International Business Machines Corporation | Refining tail call optimizations at link-time |
| US7661092B1 (en) * | 2008-12-30 | 2010-02-09 | International Business Machines Corporation | Intelligent reuse of local variables during bytecode compilation |
| KR101283469B1 (ko) | 2009-08-31 | 2013-07-12 | 한국전자통신연구원 | 프로세서 명령어의 메모리 액세스 방법 및 장치 |
| CN103294517B (zh) | 2012-02-22 | 2018-05-11 | 国际商业机器公司 | 堆栈溢出保护装置、堆栈保护方法、相关编译器和计算装置 |
| US10114573B1 (en) * | 2017-04-26 | 2018-10-30 | International Business Machines Corporation | Dynamic reduction of stack-overflow errors in a recursive data-serialization algorithm |
| FR3070775B1 (fr) * | 2017-09-04 | 2019-08-23 | Vsora | Allocation dynamique utilisant plusieurs piles |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS608944A (ja) * | 1983-06-28 | 1985-01-17 | Fujitsu Ltd | 関数型マシンの終端再帰呼出し制御方式 |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4530049A (en) * | 1982-02-11 | 1985-07-16 | At&T Bell Laboratories | Stack cache with fixed size stack frames |
| US5522072A (en) * | 1990-09-04 | 1996-05-28 | At&T Corp. | Arrangement for efficiently transferring program execution between subprograms |
| US5335332A (en) * | 1991-12-24 | 1994-08-02 | International Business Machines Corporation | Method and system for stack memory alignment utilizing recursion |
| US5590332A (en) * | 1995-01-13 | 1996-12-31 | Baker; Henry G. | Garbage collection, tail recursion and first-class continuations in stack-oriented languages |
| US6101326A (en) * | 1997-05-29 | 2000-08-08 | Hewlett-Packard Company | Method and apparatus for frame elimination for simple procedures with tail calls |
-
2002
- 2002-03-25 EP EP02705496A patent/EP1383044A1/en not_active Withdrawn
- 2002-03-25 WO PCT/JP2002/002888 patent/WO2002077802A1/ja not_active Ceased
- 2002-03-25 JP JP2002575788A patent/JP3785596B2/ja not_active Expired - Fee Related
-
2003
- 2003-07-25 US US10/628,133 patent/US7130972B2/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPS608944A (ja) * | 1983-06-28 | 1985-01-17 | Fujitsu Ltd | 関数型マシンの終端再帰呼出し制御方式 |
Non-Patent Citations (5)
| Title |
|---|
| ISHIZAKI ET AL.: "Java just-in-time compiler ni okeru saitekika to sono hyoka", THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS GIJUTSU KENKYU HOKOKU (CPSY99-64), vol. 99, no. 252, 5 August 1999 (1999-08-05), pages 17 - 24, XP002951530 * |
| KOMIYA YUASA: "Museigen no jumyo o matsu tan'itsu yobidashi keizoku", TRANSACTIONS OF INFORMATION PROCESSING SOCIETY OF JAPAN, vol. 37, no. 1, 15 January 1996 (1996-01-15), pages 92 - 100, XP002951528 * |
| MAEDA SOWA: "Asai sokubaku ni yoru doteki scope hensu ga sonzai suru tokino matsubi saiki yobidashi", TRANSACTIONS OF INFORMATION PROCESSING SOCIETY OF JAPAN, vol. 41, no. SIG4 (PRO07), 15 June 2000 (2000-06-15), pages 1 - 10, XP002951527 * |
| MATSUOKA: "Open JIT- jiko han'ei keisan ni motoduita doteki ni henki kano no java JIT compiler", COMPUTER TODAY, vol. 15, no. 6, 1 November 1998 (1998-11-01), pages 4 - 11, XP002951531 * |
| WATANABE ITO: "Call/cc o mochiita kurikaeshi teki scheme program to CPS henkan", INFORMATION PROCESSING SOCIETY OF JAPAN (94-SYM-75), vol. 94, no. 79, 16 September 1994 (1994-09-16), pages 7 - 14, XP002951529 * |
Also Published As
| Publication number | Publication date |
|---|---|
| EP1383044A1 (en) | 2004-01-21 |
| JP3785596B2 (ja) | 2006-06-14 |
| US7130972B2 (en) | 2006-10-31 |
| US20040088686A1 (en) | 2004-05-06 |
| JPWO2002077802A1 (ja) | 2004-08-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR100573043B1 (ko) | 컴파일링된활성화레코드를동적최적화해제하는방법및장치 | |
| CN111736884B (zh) | 组件化方法和系统 | |
| JPH11237991A5 (ja) | ||
| US7406684B2 (en) | Compiler, dynamic compiler, and replay compiler | |
| EP0933706B1 (en) | Language processing system and language processing method enabling reduction of memory region and overhead in profile information collection of computer | |
| WO2002077802A1 (en) | Function executing method, function executing device, computer program and recording medium | |
| CN110334024B (zh) | 一种基于树状结构的测试用例管理方法、装置及终端 | |
| CN112328298A (zh) | 移动端的代码库裁剪方法及装置 | |
| CN115292201B (zh) | 函数调用栈解析和回溯方法与装置 | |
| CN114024865B (zh) | 基于Linux进程函数的网络审计方法、装置、系统 | |
| JP4769946B2 (ja) | メモリ管理方法、メモリ管理装置、及びメモリ管理プログラムが記録されている記録媒体 | |
| US9389843B2 (en) | Efficient interpreter profiling to obtain accurate call-path information | |
| CN1781127B (zh) | 便携式数据载体中的存储器管理方法 | |
| JP2007226784A (ja) | インラインされたメソッドの呼出方法およびそれを用いたジャバ仮想マシン | |
| JP3790707B2 (ja) | プログラム変換方法、これを用いたコンピュータ装置及びプログラム | |
| JP4864287B2 (ja) | 識別方法、記録媒体及びコンピュータシステム | |
| US20050060707A1 (en) | Method for iterating through elements of a collection | |
| CN109040645B (zh) | 音视频文件转录方法、装置及存储介质、服务器 | |
| JP3049814B2 (ja) | マイクロコンピュータの言語処理装置 | |
| CN118069244A (zh) | 一种安全插件的配置方法及装置、数据采集系统 | |
| CN118626111A (zh) | 一种前端项目部署优化方法及系统 | |
| CN116501710A (zh) | 一种无入侵日志压缩方法、系统、设备及存储介质 | |
| JP3807860B2 (ja) | コンパイル方法および装置、並びにメソッド活動度計算方法および装置 | |
| KR20210078396A (ko) | 컴퓨터 내 행위 이벤트 축약 방법 | |
| CN112948000B (zh) | 栈空间统计方法、装置及介质 |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| AK | Designated states |
Kind code of ref document: A1 Designated state(s): JP US |
|
| AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR |
|
| DFPE | Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101) | ||
| 121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
| WWE | Wipo information: entry into national phase |
Ref document number: 10628133 Country of ref document: US |
|
| WWE | Wipo information: entry into national phase |
Ref document number: 2002705496 Country of ref document: EP |
|
| WWP | Wipo information: published in national office |
Ref document number: 2002705496 Country of ref document: EP |
|
| WWE | Wipo information: entry into national phase |
Ref document number: 2002575788 Country of ref document: JP |
|
| WWW | Wipo information: withdrawn in national office |
Ref document number: 2002705496 Country of ref document: EP |