Claims Analysis
Total Claims: 29
Claim 1
Independent Claim
145 words
A method for self-recursively mapping a page table tree into a virtual address space containing virtual pages, the method comprising the steps of: identifying a segment table node of the page table tree; identifying a plurality of leaf nodes of the page table tree, each leaf node containing at least one page table entry, each page table entry matching a virtual page number to a corresponding physical page number by containing the physical page number at a location in the page table tree that corresponds to the virtual page number, a plurality of the page table entries functioning simultaneously as pointers to nodes in the page table tree and as addresses of physical pages corresponding to virtual pages; and mapping the leaf nodes into the virtual address space with the page table entries ordered in the virtual address space according to their virtual page numbers.
Claim 2
Independent Claim
145 words
A method for self-recursively mapping a page table tree into a virtual address space containing virtual pages, the method comprising the steps of: identifying a segment table node of the page table tree; identifying a plurality of leaf nodes of the page table tree, each leaf node containing at least one page table entry, each page table entry matching a virtual page number to a corresponding physical page number by containing the physical page number at a location in the page table tree that corresponds to the virtual page number, a plurality of the page table entries functioning simultaneously as pointers to nodes in the page table tree and as addresses of physical pages corresponding to virtual pages; and mapping the leaf nodes into the virtual address space with the page table entries ordered in the virtual address space according to their virtual page numbers.
Claim 3
Dependent Claim
20 words
The method of claim 1, further comprising the step of mapping the segment table node into the virtual address space.
Claim 4
Dependent Claim
26 words
The method of claim 2, wherein the segment table node and at least one of the leaf nodes are both mapped to the same virtual page.
Claim 5
Dependent Claim
33 words
The method of claim 1, wherein the step of mapping the leaf nodes into the virtual address space comprises mapping the leaf nodes into a single contiguous region of the virtual address space.
Claim 6
Dependent Claim
35 words
The method of claim 1, further comprising the step of identifying at least one intermediate node between the segment table node of the page table tree and the leaf nodes of the page table tree.
Claim 7
Dependent Claim
19 words
The method of claim 5, further comprising the step of mapping the intermediate node into the virtual address space.
Claim 8
Dependent Claim
25 words
The method of claim 6, wherein the intermediate node and at least one of the leaf nodes are both mapped to the same virtual page.
Claim 9
Dependent Claim
22 words
The method of claim 6, wherein the intermediate node and the segment table node are both mapped to the same virtual page.
Claim 10
Dependent Claim
75 words
The method of claim 1, further comprising the steps of: creating a zeroes page by setting the contents of a physical page of memory to zeroes; and mapping at least one virtual page to the zeroes page by placing the address of the zeroes page in a page table entry in the page table tree, thereby allowing a virtual memory manager to detect references to missing page table tree nodes without requiring a page fault.
Claim 11
Dependent Claim
105 words
The method of claim 9, further comprising the steps of: identifying at least one intermediate node between the segment table node of the page table tree and the leaf nodes of the page table tree; creating a pointer page by setting the contents of a physical page of memory to the address of the zeroes page; and mapping at least one virtual page to the pointer page by placing the address of the pointer page in a page table entry in the page table tree, thereby allowing a virtual memory manager to detect references; to missing page table tree nodes without requiring a page fault.
Claim 12
Independent Claim
132 words
A method for use by a virtual memory manager in managing a first virtual address space and a second virtual address space, the method comprising the steps of: identifying a first page table tree of a first process corresponding to the first virtual address space; identifying a second page table tree of a second process corresponding to the second virtual address space; and mapping the second virtual address space into the first virtual address space by placing the address of a segment node of the second page table tree into a reserved segment table entry in the first page table tree, at least one of the page table trees being self-recursive in that two nodes at different levels of that page table tree are both stored in the same page of memory.
Claim 13
Independent Claim
132 words
A method for use by a virtual memory manager in managing a first virtual address space and a second virtual address space, the method comprising the steps of: identifying a first page table tree of a first process corresponding to the first virtual address space; identifying a second page table tree of a second process corresponding to the second virtual address space; and mapping the second virtual address space into the first virtual address space by placing the address of a segment node of the second page table tree into a reserved segment table entry in the first page table tree, at least one of the page table trees being self-recursive in that two nodes at different levels of that page table tree are both stored in the same page of memory.
Claim 14
Dependent Claim
35 words
The method of claim 11, wherein at least one of the first page table tree and the second page table tree contains an intermediate node located between a segment table node and a leaf node.
Claim 15
Dependent Claim
32 words
The method of claim 11, wherein the first page table tree and the second page table tree each contain an intermediate node located between a segment table node and a leaf node.
Claim 16
Independent Claim
188 words
An apparatus for translating a virtual page number portion of a given virtual address into a corresponding physical page number, the apparatus comprising: a self-recursive page table tree having a segment table node and a plurality of leaf nodes, each leaf node containing at least one page table entry, each page table entry matching a virtual page number to a corresponding physical page number by containing the physical page number at a location in the page table tree that corresponds to the virtual page number; a memory management unit configured to attempt no read the physical page number from the page table entry which matches the virtual page number, to fail in that attempt when no physical page number presently corresponds to the virtual page number, and to make an additional attempt after the page table entry is updated; and a virtual memory manager configured to update the page table entry if the memory management unit fails in its attempt to read a physical page number from the page table entry, the virtual memory manager accessing the page table entries by virtual addresses in a virtual address space.
Claim 17
Independent Claim
188 words
An apparatus for translating a virtual page number portion of a given virtual address into a corresponding physical page number, the apparatus comprising: a self-recursive page table tree having a segment table node and a plurality of leaf nodes, each leaf node containing at least one page table entry, each page table entry matching a virtual page number to a corresponding physical page number by containing the physical page number at a location in the page table tree that corresponds to the virtual page number; a memory management unit configured to attempt no read the physical page number from the page table entry which matches the virtual page number, to fail in that attempt when no physical page number presently corresponds to the virtual page number, and to make an additional attempt after the page table entry is updated; and a virtual memory manager configured to update the page table entry if the memory management unit fails in its attempt to read a physical page number from the page table entry, the virtual memory manager accessing the page table entries by virtual addresses in a virtual address space.
Claim 18
Dependent Claim
23 words
The apparatus of claim 14, wherein the page table entries are ordered in the virtual address space according to their virtual page numbers.
Claim 19
Dependent Claim
30 words
The apparatus of claim 14, wherein the virtual memory manager accesses both the segment table node and at least one of the leaf nodes using the same virtual page number.
Claim 20
Dependent Claim
19 words
The apparatus of claim 14, wherein a single contiguous region of the virtual address space contains the leaf nodes.
Claim 21
Dependent Claim
26 words
The apparatus of claim 14, wherein the page table tree further comprises at least one intermediate node between the segment table node and the leaf nodes.
Claim 22
Dependent Claim
26 words
The apparatus of claim 18, wherein the virtual memory manager accesses both the intermediate node and the segment table node using the same virtual page number.
Claim 23
Dependent Claim
29 words
The apparatus of claim 18, wherein the virtual memory manager accesses both the intermediate node and at least one of the leaf nodes using the same virtual page number.
Claim 24
Dependent Claim
53 words
The apparatus of claim 14, wherein the page table tree further comprises a zeroes page table entry which contains the physical page number of a physical page of memory whose contents are zeroes, thereby allowing the virtual memory manager to detect references to missing page table tree nodes without requiring a page fault.
Claim 25
Dependent Claim
81 words
The apparatus of claim 21, wherein the page table tree further comprises: at least one intermediate node between the segment table node of the page table tree and the leaf nodes of the page table tree; and a pointer page table entry which contains the address of a physical page of memory whose contents are the address of the zeroes page, thereby allowing the virtual memory manager to detect references to missing page table tree nodes without requiring a page fault.
Claim 26
Independent Claim
282 words
An apparatus for translating a virtual page number portion of a given virtual address into a corresponding physical page number, the given virtual address being within the union of a first virtual address space and a second virtual address space, the apparatus comprising: a first page table tree of a first process corresponding to the first virtual address space; a second page table tree of a second process corresponding to the second virtual address space, each page table tree having a respective segment table node and a respective plurality of leaf nodes, each leaf node containing at least one page table entry, each page table entry matching a virtual page number to a corresponding physical page number by containing the physical page number at a location in the respective page table tree that corresponds to the virtual page number, at least one of the page table trees being self-recursive, the apparatus further characterized in that a reserved segment table entry in the first page table tree contains the address of the segment node of the second page table tree; a memory management unit configured to attempt to read the physical page number from the page table entry which matches the virtual page number, to fail in that attempt when no physical page number presently corresponds to the virtual page number, and to make an additional attempt after the page table entry is updated; and a virtual memory manager configured to update the page table entry if the memory management unit fails in its attempt to read a physical page number from the page table entry, the virtual memory manager accessing the page table entries by virtual addresses in a virtual address space.
Claim 27
Independent Claim
282 words
An apparatus for translating a virtual page number portion of a given virtual address into a corresponding physical page number, the given virtual address being within the union of a first virtual address space and a second virtual address space, the apparatus comprising: a first page table tree of a first process corresponding to the first virtual address space; a second page table tree of a second process corresponding to the second virtual address space, each page table tree having a respective segment table node and a respective plurality of leaf nodes, each leaf node containing at least one page table entry, each page table entry matching a virtual page number to a corresponding physical page number by containing the physical page number at a location in the respective page table tree that corresponds to the virtual page number, at least one of the page table trees being self-recursive, the apparatus further characterized in that a reserved segment table entry in the first page table tree contains the address of the segment node of the second page table tree; a memory management unit configured to attempt to read the physical page number from the page table entry which matches the virtual page number, to fail in that attempt when no physical page number presently corresponds to the virtual page number, and to make an additional attempt after the page table entry is updated; and a virtual memory manager configured to update the page table entry if the memory management unit fails in its attempt to read a physical page number from the page table entry, the virtual memory manager accessing the page table entries by virtual addresses in a virtual address space.
Claim 28
Dependent Claim
35 words
The apparatus of claim 23, wherein at least one of the first page table tree and the second page table tree contains an intermediate node located between a segment table node and a leaf node.
Claim 29
Dependent Claim
32 words
The apparatus of claim 23, wherein the first page table tree and the second page table tree each contain an intermediate node located between a segment table node and a leaf node.