Querying and traversal method and device for virtual memory area

Abstract

The embodiment of the invention discloses a querying and traversal method and a device for a virtual memory area, wherein, the method comprises the steps of determining and querying whether the virtual memory area vma corresponding to an address is in an adjacent range of a buffer vma which comprises at least one address range front adjacent to the vma and at least one address range rear adjacent to the vma of the buffer vma; if yes, querying the vma according to clues on nodes of a clue red black tree, wherein, the nodes are nodes to which the buffer vma corresponds, and the clues are pointers pointing the front driving nodes and back driving nodes of the nodes on the clue red black tree. The embodiment of the invention also discloses a traversal method of the virtual memory area, because the confirmations for the adjacent ranges of the buffer vma can be always satisfied, the hit rate for accessing a buffer is improved, and the realized whole vma traversal time complex rate is O(n), thereby improving the querying efficiency of the vma.

Description

technical field [0001] Embodiments of the present invention relate to communication technologies, and in particular, to a method and device for querying and traversing a virtual memory area. Background technique [0002] At present, Linux technology usually uses a red-black tree form to query a virtual memory area (virtual memory area, hereinafter referred to as: vma). [0003] Specifically, for the process of querying the nth vma, the query function find_vma obtains the memory description information (mm) and reads the semaphore, starting from the address m, to confirm whether the vma corresponding to the address m is within the address range of the cache vma, if so , that is, the query hits the cache this time, the vma corresponding to the address m is queried by accessing the cache vma, and the read semaphore is released. If not, the red-black tree is traversed from the root node to query the vma corresponding to the address m. and release the read semaphore. [0004] W...

AI Technical Summary

Problems solved by technology

[0004] Since the query function find_vma must start from the root node to query vma by traversing when it does not hit the cache, the query efficiency of the existing technology is low

Images