eec78d9f5d
* [utest/mm] add testcase for create/init format codes of create/init in components/mm * [libcpu/aarch64] fix user stack check routine * [kservice] export API for utest * [utest/mm] testcase for aspace_map format & modify the files under components/mm related with aspace_map * [lwp/user_mm] add user_map_varea for mmap feature * [mm] rename rt_mm_fault_try_fix to rt_aspace_fault_try_fix * [utest/mm] testcase for synchronization * [mm] modify unmap api to improve throughput * [utest/mm] testcases for cache and varea map * [format] remove extra space * [utest/mm] fix testcase problem in header * [lwp] extend map_user_varea with a flag * [utest/mm] testcase for lwp_map_user_varea * [libcpu/arm/cortex-a] fix kernel space layout * [utest/mm] adjust for armv7 arch
100 lines
2.3 KiB
C
100 lines
2.3 KiB
C
/*
|
|
* Copyright (c) 2006-2022, RT-Thread Development Team
|
|
*
|
|
* SPDX-License-Identifier: Apache-2.0
|
|
*
|
|
* Change Logs:
|
|
* Date Author Notes
|
|
* 2022-11-14 WangXiaoyao the first version
|
|
*/
|
|
#ifndef __MM_PRIVATE_H__
|
|
#define __MM_PRIVATE_H__
|
|
|
|
#include "mm_aspace.h"
|
|
#include <rtdef.h>
|
|
#include <stddef.h>
|
|
|
|
/**
|
|
* @brief DATA STRUCTURE & API USED INTERNALLY
|
|
*
|
|
* This is mainly a wrapper layer to actual data structure.
|
|
* In this way, we can switch to any BST we like by adding new
|
|
* wrapper code.
|
|
* Every BST must satisfy the API to support MM
|
|
*
|
|
* *INFO: varea range convention
|
|
* For API, a range is specified by a base and its length.
|
|
* This provides a clear interface without ambiguity.
|
|
* For implementation, a range is specified by [start, end] tuple
|
|
* where both start and end are inclusive.
|
|
*/
|
|
|
|
struct _mm_range
|
|
{
|
|
void *start;
|
|
void *end;
|
|
};
|
|
|
|
/**
|
|
* @brief
|
|
*
|
|
* @param aspace
|
|
* @return rt_err_t
|
|
*/
|
|
rt_err_t _aspace_bst_init(struct rt_aspace *aspace);
|
|
|
|
/**
|
|
* @brief Retrieve any varea if start in [varea->start, varea->end]
|
|
*
|
|
* @param aspace
|
|
* @param start
|
|
* @return struct rt_varea*
|
|
*/
|
|
struct rt_varea *_aspace_bst_search(struct rt_aspace *aspace, void *start);
|
|
|
|
/**
|
|
* @brief Retrieve lowest varea satisfies (varea->start >= start)
|
|
*
|
|
* @param aspace
|
|
* @param length
|
|
* @param struct _mm_range
|
|
* @return struct rt_varea*
|
|
*/
|
|
struct rt_varea *_aspace_bst_search_exceed(struct rt_aspace *aspace,
|
|
void *start);
|
|
|
|
/**
|
|
* @brief Retrieve any varea overlaps a specified address range
|
|
*
|
|
* @param aspace
|
|
* @param start
|
|
* @param length
|
|
* @return struct rt_varea*
|
|
*/
|
|
struct rt_varea *_aspace_bst_search_overlap(struct rt_aspace *aspace,
|
|
struct _mm_range range);
|
|
|
|
/**
|
|
* @brief Insert a varea into the bst
|
|
*
|
|
* @param aspace
|
|
* @param varea
|
|
*/
|
|
void _aspace_bst_insert(struct rt_aspace *aspace, struct rt_varea *varea);
|
|
|
|
/**
|
|
* @brief Remove a varea from the bst
|
|
*
|
|
* @param aspace
|
|
* @param varea
|
|
*/
|
|
void _aspace_bst_remove(struct rt_aspace *aspace, struct rt_varea *varea);
|
|
|
|
void rt_varea_pgmgr_pop(rt_varea_t varea, void *vaddr, rt_size_t size);
|
|
|
|
void rt_varea_pgmgr_pop_all(rt_varea_t varea);
|
|
|
|
int _varea_map_with_msg(rt_varea_t varea, struct rt_aspace_fault_msg *msg);
|
|
|
|
#endif /* __MM_PRIVATE_H__ */
|