Lines Matching refs:start
26 printf("%p ", varea->start); in _print_varea()
65 RT_ASSERT(varea->start > lchild->start); in _is_bst()
70 if (varea->start >= rchild->start) in _is_bst()
110 if (varea->start >= _start && (!_boundary || varea->start >= _boundary) && _is_bst(varea)) in _check_asc_before()
113 _start = varea->start; in _check_asc_before()
114 _boundary = varea->start + varea->size; in _check_asc_before()
161 add_elem->start, varea->start, _count, _buf[_count]); in _check_asc_after()
368 int cmp = compare(range.start, range.end, varea->start, in search()
369 varea->start + varea->size - 1); in search()
394 rt_varea_t _aspace_bst_search_exceed(struct rt_aspace *aspace, void *start) in _aspace_bst_search_exceed() argument
403 void *va_s = varea->start; in _aspace_bst_search_exceed()
404 int cmp = compare_exceed(start, start, va_s, va_s); in _aspace_bst_search_exceed()
408 ptrdiff_t off = va_s - start; in _aspace_bst_search_exceed()
447 rt_ubase_t key = (rt_ubase_t)varea->start; in _aspace_bst_insert()
455 if (key < (rt_ubase_t)data->start) in _aspace_bst_insert()
457 else if (key > (rt_ubase_t)data->start) in _aspace_bst_insert()
519 varea->start = (void *)(uintptr_t)dataset[i]; in insert_test()
529 void *start = (void *)(uintptr_t)dataset[i]; in search_test() local
531 varea = _aspace_bst_search(&aspace, start); in search_test()
533 assert(varea->start == start); in search_test()
541 void *start = (void *)(uintptr_t)dataset[i]; in delete_test() local
543 varea = _aspace_bst_search(&aspace, start); in delete_test()