Pre-Grant Publication Number: 20070234286
Please help the USPTO examine the application by evaluating the relevance of the publicly submitted prior art to the patent application.
Peer To Patent forwards the Top 10 most relevant prior art submissions and their annotations to the USPTO.
Review this prior art and click on the thumbs up (or down) to indicate whether this submission should be forwarded to the USPTO.
If you login then you can add an annotation by typing in the box at the bottom of the screen to comment on the relevance of the prior art to the claims of the patent application.
Review this prior art and click on the thumbs up (or down) to indicate whether this submission should be forwarded to the USPTO.
If you login then you can add an annotation by typing in the box at the bottom of the screen to comment on the relevance of the prior art to the claims of the patent application.
Prior Art Detail
Summary / Description
| Summary / Description | The invention relates to a method to optimize computer programs using annotations. |
Basic Information
| Type of Prior Art | Issued Patents - US |
| Country | United States of America |
| Patent/Application # | 6993754 |
| Kind Code | United States (US) - Reexamination Certificate Seco... - B2 |
| Patentee Name | Hewlett-Packard Development Company, L.P. |
| Relevant Pages, Columns, or Lines | |
| URL | http://patft.uspto.gov/netacgi/... |
| Filing Date | January 31, 2006 |
| Additional Information | |
Notes / To Do
| Notes | |
Excerpt
Excerpt Page - 5, Col - 2, Lines 60-64: “Thus, the invention may comprise a method of optimizing computer program, including generating annotation information about the computer program, storing the annotation information with the computer program, and optimizing the computer program based on the annotation information while the computer program is being executed.”
Page - 7, Col 6, Lines 32-51: “The information stored in the annotation is dependent upon the types of optimizations to be performed. For function inlining, in general, the annotation should contain calling convention information and information about the memory stack. The stack is used to dynamically allocate the local variables (locals) used in functions, to pass parameters to the functions, and to return values from the functions. The stack consists of logical stack frames that are pushed, or added to the stack, when calling a function, and popped, or removed from the stack, when returning from the function. A stack frame may contain the parameters to a function, its local variables, and the data necessary to recover the previous stack frame, including the value of the instruction pointer at the time of the function call. When functions are placed inline, this overhead can be removed if the annotation contains enough information about the stack frame. For example, variables local to the inlined function which are stored on the stack can be promoted to being stored in registers as long as all references to the local variables on the stack can be identified.” |
Relevance
Claims
1
Relevance
The following text describes the feature of optimizing computer program using annotation information - Page - 5, Col - 2, Lines 60-64: “Thus, the invention may comprise a method of optimizing computer program, including generating annotation information about the computer program, storing the annotation information with the computer program, and optimizing the computer program based on the annotation information while the computer program is being executed.”
The following text describes feature of using annotations for function inlining - Page - 7, Col 6, Lines 32-51: “The information stored in the annotation is dependent upon the types of optimizations to be performed. For function inlining, in general, the annotation should contain calling convention information and information about the memory stack. The stack is used to dynamically allocate the local variables (locals) used in functions, to pass parameters to the functions, and to return values from the functions. The stack consists of logical stack frames that are pushed, or added to the stack, when calling a function, and popped, or removed from the stack, when returning from the function. A stack frame may contain the parameters to a function, its local variables, and the data necessary to recover the previous stack frame, including the value of the instruction pointer at the time of the function call. When functions are placed inline, this overhead can be removed if the annotation contains enough information about the stack frame. For example, variables local to the inlined function which are stored on the stack can be promoted to being stored in registers as long as all references to the local variables on the stack can be identified.”
The following text describes the feature of optimizing computer program using annotation information - Page - 5, Col - 2, Lines 60-64: “Thus, the invention may comprise a method of optimizing computer program, including generating annotation information about the computer program, storing the annotation information with the computer program, and optimizing the computer program based on the annotation information while the computer program is being executed.”
The following text describes feature of using annotations for function inlining - Page - 7, Col 6, Lines 32-51: “The information stored in the annotation is dependent upon the types of optimizations to be performed. For function inlining, in general, the annotation should contain calling convention information and information about the memory stack. The stack is used to dynamically allocate the local variables (locals) used in functions, to pass parameters to the functions, and to return values from the functions. The stack consists of logical stack frames that are pushed, or added to the stack, when calling a function, and popped, or removed from the stack, when returning from the function. A stack frame may contain the parameters to a function, its local variables, and the data necessary to recover the previous stack frame, including the value of the instruction pointer at the time of the function call. When functions are placed inline, this overhead can be removed if the annotation contains enough information about the stack frame. For example, variables local to the inlined function which are stored on the stack can be promoted to being stored in registers as long as all references to the local variables on the stack can be identified.”
Claim Chart
Some
