JIT/compiler Java language extensions to enable field performance and serviceability

• US 6,530,075 B1
• Filed: 12/03/1998
• Issued: 03/04/2003
• Est. Priority Date: 12/03/1998
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Brown, Michael Wayne, Rothert, Douglas Scott, Beadle, Bruce Anthony, Paolini, Michael Anthony
• Primary Examiner(s): Morse, Gregory
• Assistant Examiner(s): NGUYEN BA, HOANG VU A
• Application Number:
  US09/204,968
• Time in Patent Office: 1,552 Days
• Field of Search: 717/9, 717/7, 717/4, 717/5, 717/6, 717/1, 717/151-167, 717/136, 717/140, 717/146-150, 717/114, 717/116, 717/118, 717/124, 717/100, 709/100
• US Class Current: 717/114
• CPC Class Codes: G06F 8/443 Optimisation
• CPC Class Codes: G06F 9/45516 Runtime code conversion or optimisation

Abstract

The present invention provides a method and apparatus in a data processing system for optimizing running of bytecode. An application programming interface is called for compilation of bytecode. The bytecode just in time compiling is enabled or disabled using the application programming interface. Compiling the bytecode is optimized by the programmer before compiling using pre-compile keywords. Compiling the bytecode is optimized during compiling using dynamic application programming interface calls. Dynamic runtime APIs enable or disable the just in time compiling of objects based on compiling errors, execution performance and frequency of execution.

Claims

1. A process implemented in a data processing system for optimizing compiling of a bytecode, the process comprising the data processing system implemented step of:

extending a language to cover controlling compiling of the bytecode, wherein an extended language is formed;

running the bytecode; and

controlling compiling of the bytecode using the extended language.

2. The process of claim 1, wherein extending the language includes creating an interactive runtime application programming interface.

3. The process of claim 2, wherein the step of controlling compiling of the bytecode includes enabling just in time coupling of the bytecode.

4. A process implemented in a data processing system for optimizing compiling of a bytecode, the process comprising the data processing system implemented steps of:

extending a language to convert controlling compiling of the bytecode, wherein an extended language is formed;

statically scoping the bytecode using the extended language to form a scoped bytecode;

running the scoped bytecode; and

controlling compiling of the scope bytecode using the extended language.

5. The process of claim 4, wherein the step of statically scoping the bytecode includes specifying a type of optimization for compiling the bytecode.

6. The process of claim 4, wherein the step of statically scoping the bytecode includes specifying just in time compiling the bytecode.

7. The process of claim 4, wherein the step of statically scoping the bytecode includes satisfying not just in time compiling the bytecode.

8. The process of claim 7, wherein the bytecode is at least one of a class, method and code section.

9. A process implemented in a data processing system for optimizing compiling of a bytecode, the process comprising the data processing system implemented step of:

extending a language to cover controlling compiling of the bytecode, wherein an extended language is formed and, wherein extending a language comprise adding at least one keyword related to optimizing compiling of the bytecode;

running the bytecode; and

controlling compiling of the bytecode using the extended language.

10. A process in a data processing system for optimizing compiling of a bytecode, the process comprising the data processing system implemented step of:

extending a language to cover controlling compiling of the bytecode, wherein an extended language is formed;

running the bytecode; and

controlling compiling of the bytecode using the extended language in runtime.

11. The process of claim 10, wherein the step of controlling compiling of the bytecode includes enabling just in time compiling based on frequency of running the bytecode.

12. The process of claim 10, wherein the step of controlling compiling of the bytecode further comprises:

interactively monitoring performance of compiling the bytecode; and

optimizing the compiling of the bytecode based on the compilation performance.

13. The process of claim 12, wherein the performance is measured by speed of compiling the bytecode.

14. The process of claim 12, wherein the performance is measured by memory space needed to store a compiled bytecode.

15. A process in a data processing system for optimizing compiling of a bytecode, the process comprising the data processing system implemented step of:

extending a language to cover controlling compiling of the bytecode, wherein an extended language is formed;

running the bytecode; and

controlling compiling of the bytecode using the extended language in runtime, wherein the step of controlling compiling of the bytecode includes preventing just in time compiling based on an error in compiling.

16. A process system for optimizing compiling of a bytecode, comprising:

language extension, wherein the language extension controls compiling of the bytecode;

running means for running the bytecode; and

controlling means for controlling compiling of the bytecode using the extended language.

17. The processing system of claim 16, wherein the language extension includes an interactive runtime application programming interface.

18. The processing system of claim 17, wherein the controlling means includes enabling just in time compiling of the bytecode.

19. A processing system for optimizing compiling of a bytecode, comprising:

a language extension to cover controlling compiling of the bytecode, wherein an extended language is formed;

running means for running the bytecode;

controlling means for controlling compiling of the bytecode using the extended language; and

static scoping means for statically scoping the bytecode.

20. The processing system of claim 19, wherein the static scoping means includes a specifying means for specifying a type of organization for compiling the bytecode.

21. The processing system of claim 19, wherein the static scoping means includes specifying means for specifying just in time compiling the bytecode.

22. The processing system of claim 19, wherein the static scoping means includes specifying means for specifying not just in time compiling the bytecode.

23. The processing system of claim 22, wherein the bytecode is at least one of a class, method and code section.

24. A processing system for optimizing compiling of a bytecode, comprising:

language extension to cover controlling compiling of the bytecode, wherein an extended language is formed, wherein the language extension comprises adding at least one keyword related to optimizing compiling of bytecode;

running means for running the bytecode; and

controlling means for controlling compiling of the bytecode using the extended language.

25. A processing system for optimizing compiling of a bytecode, comprising:

language extension to cover controlling compiling of the bytecode, wherein an extended language is formed;

running means for running the bytecode; and

controlling compiling of the bytecode using the extended language in runtime, wherein the controlling means for controlling compiling of the bytecode includes preventing just in time compiling based on an error in compiling.

27. The processing system product of claim 25, wherein the controlling means for controlling compiling of the bytecode includes enabling just in time compiling based on frequency of running the bytecode.

28. The processing system product of claim 25, wherein the controlling means for controlling compiling of the bytecode further comprises:

interactive monitoring means for interactively monitoring performance of compiling the bytecode; and

optimizing means for optimizing the compiling of the bytecode based on the compilation performance.

29. The processing system of claim 28, wherein the performance is measured by speed of compiling the bytecode.

30. The processing system of claim 28, wherein the performance is measured by memory space needed to store a compiled bytecode.

26. A processing system for optimizing compiling of a bytecode, comprising:

a language extension, wherein the language extension controls compiling of the bytecode;

running means for running the bytecode; and

controlling compiling of the bytecode using the extended language in runtime.

31. A computer program product including instructions implemented on a data processing system for optimizing compiling of a bytecode, the instructions embodied on a computer readable medium and comprising:

a language extension to cover controlling compiling of the bytecode;

instructions for running the bytecode; and

instructions for controlling compiling of the bytecode using the language extension.

32. The method of claim 31, wherein the language extension includes an interactive runtime application programming interface.

33. The computer program product of claim 32, wherein instructions for controlling compiling of the bytecode includes enabling just in time compiling the bytecode.

34. A computer program product including instructions implemented on a data processing system for optimizing compiling of a bytecode, the instructions embodied on a computer readable medium and comprising:

a language extension to cover controlling compiling of the bytecode;

instructions for running the bytecode;

instructions for controlling compiling of the bytecode using the language extension, and

instructions for statically scoping the bytecode.

35. The computer program product of claim 34, wherein instructions for statically scoping the bytecode includes instructions for specifying a type of optimization for compiling the bytecode.

36. The computer program product of claim 34, wherein instructions for statically scoping the bytecode includes instructions for specifying just in time compiling the bytecode.

37. The computer program product of claim 34, wherein instructions for statically scoping the bytecode includes instructions for specifying not just in time compiling of the bytecode.

38. The computer program product of claim 37, wherein the bytecode is at least one of a class, method and code section.

39. A computer program product including instructions implemented on a data processing system for optimizing compiling of a bytecode, the instructions embodied on a computer readable medium and comprising:

language extension to cover controlling compiling of the bytecode, wherein the language extension comprises adding at least one keyword related to optimizing compiling of the bytecode;

instructions for running the bytecode; and

instructions for controlling compiling of the bytecode using the language extension.

40. A computer program product including instructions implemented on a data processing system for optimizing compiling of a bytecode, the instructions embodied on a computer readable medium and comprising:

language extension to cover controlling compiling of the bytecode;

instructions for running the bytecode; and

instructions for controlling compiling of the bytecode using the language extension in runtime, wherein the instructions for controlling compiling of the bytecode includes preventing just in time comprising based on an error in compiling.

41. A computer program product including instructions implemented on a data processing system for optimizing compiling of bytecode, the instructions embodied on a computer readable medium and comprising:

language extension to cover controlling compiling of the bytecode;

instructions for running the bytecode; and

instructions for controlling compiling of the bytecode using the language extension in runtime.

42. The computer program product of claim 41, wherein the instructions for controlling compiling of the bytecode includes enabling just in time compiling based on frequency of running the bytecode.

43. The computer program product of claim 41, wherein the controlling compiling of the bytecode further comprises:

instructions for interactively monitoring performance of compiling the bytecode; and

instructions for optimizing the compiling of the bytecode based on the compilation performance.

44. The computer program product of claim 43, wherein the performance is measured by speed of compiling the bytecode.

45. The computer program product of claim 43, wherein the performance is measured by memory space needed to store a compiled bytecode.

46. A process in a data processing system to optimizing running a plurality of bytecodes, the method comprising:

inserting a language extension within the plurality of bytecodes; and

executing the plurality of bytecode, wherein the language extension causes a selected portion of the plurality of bytecodes to be compiled while unselected portions of the plurality of bytecodes are interpreted.

47. The process of claim 46, wherein the selected portion of the plurality of bytecodes is a method of a number of bytecodes.

48. The process of claim 46, wherein the language extension is inserted into a source code, which is compiled into the plurality of bytecodes.

49. The process in a data processing system for optimizing running of a plurality of bytecodes, the method comprising:

receiving a plurality of bytecodes; and

responsive to detecting a language extension, selectively compiling a portion of the plurality bytecodes while interpreting the other portion of the plurality of bytecodes.

50. The process of claim 49, wherein the portion of the plurality of bytecodes is a method.

51. The process of claim 49, wherein the process is located in a Java virtual machine.

52. A data processing system comprising:

inserting means for inserting a language extension within a plurality of bytecodes; and

executing means for executing the plurality of bytecode, wherein the language extension causes a select portion of the plurality of bytecodes to be compiled while unselected portions of the plurality of bytecodes are interpreted.

53. The process of claim 52, wherein the selected portion of the plurality of bytecodes is a method of a number of bytecodes.

54. The process of claim 52, wherein the language extension is inserted into a source code, which is compiled into the plurality of bytecodes.

55. A data processing system comprising:

receiving means for receiving a plurality of bytecodes; and

executing means, responsive to detecting a language extension, for selectively compiling a portion of the plurality bytecodes while interpreting the other portion of the plurality of bytecodes.

56. The process of claim 55, wherein the portion of the plurality of bytecodes is method.

57. The process of claim 55, wherein the receiving means and the executing means are located in a Java virtual machine.

58. A data processing system comprising:

a bus;

a memory connected to the bus, wherein the memory includes as set of instructions;

a processor connected to the bus, wherein the processor executes the set of instructions to insert a language extension within a plurality of bytecodes; and

execute the plurality of bytecode, wherein the language extensions causes a selected portion of the plurality of bytecodes to be compiled while unselected portions of the plurality of bytecodes are interpreted.

59. A data processing system comprising:

a bus;

a memory connected to the bus, wherein the memory includes a set of instructions;

a processor connected to the bus, wherein the processor executes the set of instructions to receive a plurality of bytecodes, selectively compile a portion of the plurality bytecodes, and interpret the other portion of the plurality of bytecodes in response to detecting a language extension.

60. A computer program product in a computer readable medium for optimizing running a plurality of bytecodes in a data processing system, the computer program product comprising:

first instructions for inserting a language extension within a plurality of bytecodes; and

second instructions for executing the plurality of bytecode, wherein the language extension causes a selected portion of the plurality of bytecodes to be compiled while unselected portions of the plurality of bytecodes are interpreted.

61. The computer program product of claim 60, wherein the selected portion of the plurality of bytecodes is a method of a number of bytecodes.

62. The computer program product of claim 60, wherein the language extension is inserted into a source code, which is compiled into the plurality of bytecodes.

63. A computer program product in a computer readable medium for optimizing running of a plurality of bytecodes in a data processing system, the computer program product comprising:

first instructions for receiving a plurality of bytecodes; and

second instructions, responsive to detecting a language extension, for selectively compiling a portion of the plurality bytecodes while interpreting the other portion of the plurality of bytecodes.

64. The computer program product of claim 63, wherein the portion of the plurality of bytecodes is a method.

65. The computer program product of claim 63, wherein the first instructions and the second instructions are located in a Java virtual machine.