Virtual memory allocation in a virtual address space having an inaccessible gap

• US 5,978,892 A
• Filed: 05/03/1996
• Issued: 11/02/1999
• Est. Priority Date: 05/03/1996
• Status: Expired due to Term

• Current Assignee: Hewlett Packard Enterprise Development LP (Hewlett-Packard Enterprise Company)
• Original Assignee: Digital Equipment Corporation (HP Inc.)
• Inventors: Noel, Karen Lee, Harvey, Michael Seward
• Primary Examiner(s): Chan, Eddie P.
• Assistant Examiner(s): NGUYEN, THAN VINH
• Application Number:
  US08/642,706
• Time in Patent Office: 1,278 Days
• Field of Search: 395/413, 395/497.01, 395/497.02, 395/497.03, 395/497.04, 395/621, 395/622, 395/427, 395/401, 395/493, 395/185.14, 395/185.06, 395/183.11, 395/70 3, 711/203, 711/170, 711/171, 711/172, 711/173, 711/163, 707/205
• US Class Current: 711/170
• CPC Class Codes: G06F 12/023 Free address space management
• CPC Class Codes: G06F 12/1441 for a range
• CPC Class Codes: G06F 12/145 the protection being virtual, e.g. for virtual blocks or segments before a translation mechanism
• CPC Class Codes: Y10S 707/99953 Recoverability
• CPC Class Codes: Y10S 707/99956 File allocation

Abstract

A new virtual memory system is disclosed having a virtual address space including a gap of inaccessible virtual addresses within the virtual address space. A new virtual memory allocation routine is disclosed providing a starting address of accessible virtual addresses allocated to a currently executing process in a response to a request. The accessible virtual addresses are virtually contiguous, and include no addresses from within the gap of inaccessible virtual addresses. A new virtual memory deallocation routine is further disclosed providing deallocation of ranges of virtual addresses which may or may not include addresses within the inaccessible gap.

Claims

1. A virtual memory system, comprising:

a virtual address space including virtual addresses between a lowest virtual address and a highest virtual address;

a virtual address format having a length of m bits, where bits 0 through n-1 of said m bits map said virtual address to a physical address, and where bits n through m-1 contain all zeros or all ones to match the value of bit n-1;

a gap of inaccessible virtual addresses, within said virtual address space, located equidistant from said highest virtual address and said lowest virtual address, and having a size equal to 2^m -2ⁿ ;

a virtual memory deallocation routine, responsive to a request for deallocation of virtual addresses by a currently executing process, said request including a byte length and a starting virtual address, for deallocating an amount of virtual memory equal to said byte length beginning at said starting virtual address;

means, within said virtual memory deallocation routine, for determining an end virtual address of said request equal to a sum of said starting virtual address plus said byte length minus a predetermined page size, and for sign-extending said end virtual address such that bits n through (m-1) of said end virtual address are equal to the value of bit (n-1) of said end address;

means, within said virtual memory deallocation routine, for determining a truncated end virtual address equal to said end virtual address having bits n through m-1 set to zero;

means, within said virtual memory deallocation routine, for determining a difference between said truncated end virtual address and said starting virtual address, and for determining a number of page table entries to remove equal to said difference divided by a predetermined page size, plus one; and

means, within said virtual memory deallocation routine, for removing said number of page table entries to remove from a page table structure.

2. The virtual memory system of claim 1, further comprising:

said means for removing said number of page table entries first removing a first page table entry, said first page table entry mapping said end virtual address.

3. The virtual memory system of claim 2, further comprising:

said means for removing said number of page table entries further removing page table entries that are virtually contiguous with said first page table entry and which map virtual addresses below said end virtual address.

4. The virtual memory system of claim 3, further comprising:

said means for removing said number of page table entries removing page table entries by zeroing the contents of each removed page table entry.

5. The virtual memory system of claim 4, further comprising:

said means for removing said number of page table entries adding physical pages of memory mapped to virtual memory by said number of page table entries to a pool of available physical memory.

6. The virtual memory system as in claim 5, further comprising:

means, within said virtual memory deallocation routine, for setting a first free virtual address associated with said request for deallocation of virtual addresses to said starting virtual address.

7. The virtual memory system as in claim 6 further comprising:

means, within said virtual memory deallocation routine, for determining if said starting virtual address is within said inaccessible range of virtual addresses, and for rejecting said request if said starting virtual address is within said inaccessible range of virtual addresses.

8. A virtual memory system, comprising:

a virtual address space including virtual addresses between a lowest virtual address and a highest virtual address;

a virtual address format having a length of m bits, where bits 0 through n-1 of said m bits map said virtual address to a physical address, and where bits n through m-1 contain all zeros or all ones to match the value of bit n-1;

a gap of inaccessible virtual addresses, within said virtual address space, located equidistant from said highest virtual address and said lowest virtual address, and having a size equal to 2^m -2ⁿ ;

a virtual memory deallocation routine, responsive to a request for deallocation of virtual addresses by a currently executing process, said request including a byte length and a starting virtual address, for deallocating an amount of virtual memory equal to said byte length beginning at said starting virtual address;

means, within said virtual memory deallocation routine, for determining an end virtual address of said request equal to a sum of said starting virtual address plus said byte length, and for sign-extending said end virtual address such that bits n through (m-1) of said end virtual address are equal to the value of bit (n-1) of said end address;

means, within said virtual memory deallocation routine, for determining a truncated end virtual address equal to said end virtual address having bits n through m-1 set to zero;

means, within said virtual memory deallocation routine, for determining a difference between said truncated end virtual address and said starting virtual address, and for determining a truncated difference equal to said difference having bits n through m-1 set to zero, and for determining a number of page table entries to remove equal to said truncated difference divided by a predetermined page size; and

means, within said virtual memory deallocation routine, for removing said number of page table entries to remove from a page table structure.

9. The virtual memory system of claim 8, further comprising:

said means for removing said number of page table entries first removing a first page table entry, said first page table entry mapping a page of virtual memory having a virtual address equal to said end virtual address minus a predetermined page size, said virtual address of said page of virtual memory further having bits n through m-1 set equal to the value of bit n-1.

10. The virtual memory system of claim 9, further comprising:

said means for removing said number of page table entries further removing page table entries that are virtually contiguous with said first page table entry and which map virtual addresses below said end virtual address.

11. The virtual memory system of claim 10, further comprising:

said means for removing said number of page table entries removing page table entries by zeroing the contents of each removed page table entry.

12. The virtual memory system of claim 11, further comprising:

said means for removing said number of page table entries adding physical pages of memory mapped to virtual memory by said number of page table entries to a pool of available physical memory.

13. The virtual memory system as in claim 12, further comprising:

means, within said virtual memory deallocation routine, for setting a first free virtual address associated with said request for deallocation of virtual addresses to said starting virtual address.

14. The virtual memory system as in claim 13 further comprising:

means, within said virtual memory deallocation routine, for determining if said starting virtual address is within said inaccessible range of virtual addresses, and for rejecting said request if said starting virtual address is within said inaccessible range of virtual addresses.