Method and system for optimizing memory allocation

1. A method in a data processing system for optimizing memory allocation to a stack memory instead of a heap memory, the method comprising the steps of:

determining whether an item to be placed on the heap memory escapes from the scope of the item's allocator;

determining whether the item survives the item's allocator; and

allocating the item to the stack memory responsive to the item not escaping from the scope of the item's allocator and not surviving the item's allocator,

wherein the item survives the item's allocator when a deallocator of the item does not postdominate the item's allocator and does not postdominate an allocator of a copy of a pointer to the item.

2. The method of claim 1 , wherein the step of allocating the item to the stack memory comprises replacing a heap memory instruction for allocating the item to the heap with a stack memory instruction for allocating the item to the stack.

3. The method of claim 1 , wherein the item to be placed on the heap memory escapes from the scope of the item's allocator when at least one of the item, a copy of the item, and a pointer to the item is copied to a global variable.

4. The method of claim 1 , wherein the item to be placed on the heap memory escapes from the scope of the item's allocator when at least one of the item, a copy of the item, and a pointer to the item is passed as an argument to a code section located outside of the item's allocator.

5. The method of claim 1 , wherein the item to be placed on the heap memory escapes from the scope of the item's allocator when at least one of the item, a copy of the item, and a pointer to the item is included as an argument upon exit of the item's allocator.

6. The method of claim 1 , wherein the method is performed in relation to compiling a source code.

7. The method of claim 1 , wherein the method is performed in relation to executing an object code.

8. A data processing system including a processor and memory which is configured to receive instructions from a computer-readable storage medium that cause a program running in the memory of the data processing system to perform a method for optimizing memory allocation to a stack memory instead of a heap memory, the method comprising the steps of:

determining whether an item to be placed on the heap memory escapes from the scope of the item's allocator;

determining whether the item survives the item's allocator; and

allocating the item to the stack memory responsive to the item not escaping from the scope of the item's allocator and not surviving the item's allocator,

wherein the item survives the item's allocator when a deallocator of the item does not postdominate the item's allocator and does not postdominate an allocator of a copy of a pointer to the item.

9. The data processing system of claim 8 , wherein the step of allocating the item to the stack memory comprises replacing a heap memory instruction for allocating the item to the heap with a stack memory instruction for allocating the item to the stack.

10. The data processing system of claim 8 , wherein the item to be placed on the heap memory escapes from the scope of the item's allocator when at least one of the item, a copy of the item, and a pointer to the item is copied to a global variable.

11. The data processing system of claim 8 , wherein the item to be placed on the heap memory escapes from the scope of the item's allocator when at least one of the item, a copy of the item, and a pointer to the item is passed as an argument to a code section located outside of the item's allocator.

12. The data processing system of claim 8 , wherein the item to be placed on the heap memory escapes from the scope of the item's allocator when at least one of the item, a copy of the item, and a pointer to the item is included as an argument upon exit of the item's allocator.

13. The data processing system of claim 8 , wherein the method is performed in relation to compiling a source code.

14. The data processing system of claim 8 , wherein the method is performed in relation to executing an object code.

15. A data processing system for optimizing memory allocation to a stack memory instead of a heap memory, the data processing system comprising:

a memory having a program that determines whether an item to be placed on the heap memory escapes from the scope of the item's allocator, determines whether the item survives the item's allocator, and allocates the item to the stack memory responsive to the item not escaping from the scope of the item's allocator and not surviving the item's allocator; and

a processing unit that runs the program,

wherein the item survives the item's allocator when a deallocator of the item does not postdominate the item's allocator and does not postdominate an allocator of a copy of a pointer to the item.

16. The data processing system of claim 15 , wherein the item is allocated to the stack memory in relation to compiling a source code.

17. The data processing system of claim 15 , wherein the item is allocated to the stack memory in relation to executing an object code.

18. A data processing system for optimizing memory allocation to a stack memory instead of a heap memory, the data processing system comprising:

means for determining whether an item to be placed on the heap memory escapes from the scope of the item's allocator;

means for determining whether the item survives the item's allocator; and

means for allocating the item to the stack memory responsive to the item not escaping from the scope of the item's allocator and not surviving the item's allocator,

wherein the item survives the item's allocator when a deallocator of the item does not postdominate the item's allocator and does not postdominate an allocator of a copy of a pointer to the item.