Lines Matching defs:va_start
890 * All vmap_area objects in this tree are sorted by va->va_start
1051 return (va->va_end - va->va_start);
1083 if (addr < va->va_start)
1109 if (tmp->va_start <= addr)
1141 if (!va_start_lowest || (*va)->va_start < va_start_lowest)
1142 va_start_lowest = (*va)->va_start;
1206 if (va->va_end <= tmp_va->va_start)
1208 else if (va->va_start >= tmp_va->va_end)
1212 va->va_start, va->va_end, tmp_va->va_start, tmp_va->va_end);
1354 * when VA size is modified by changing its va_start/va_end. Or
1469 if (sibling->va_start == va->va_end) {
1470 sibling->va_start = va->va_start;
1490 if (sibling->va_end == va->va_start) {
1543 if (va->va_start > vstart)
1544 nva_start_addr = ALIGN(va->va_start, align);
1581 vstart < va->va_start) {
1609 vstart <= va->va_start) {
1616 vstart = va->va_start + 1;
1681 if (nva_start_addr < va->va_start ||
1686 if (va->va_start == nva_start_addr) {
1726 va->va_start += size;
1779 lva->va_start = va->va_start;
1785 va->va_start = nva_start_addr + size;
1809 if (va->va_start > vstart)
1810 nva_start_addr = ALIGN(va->va_start, align);
1870 struct vmap_node *vn = addr_to_node(va->va_start);
1956 if (IS_ALIGNED(va->va_start, align)) {
1962 err |= (va->va_start < vstart);
2004 *addr = va->va_start;
2013 vm->addr = (void *)va->va_start;
2102 va->va_start = addr;
2108 vm->addr = (void *)va->va_start;
2113 vn = addr_to_node(va->va_start);
2119 BUG_ON(!IS_ALIGNED(va->va_start, align));
2120 BUG_ON(va->va_start < vstart);
2279 start = list_first_entry(&vn->purge_list, struct vmap_area, list)->va_start;
2283 if (is_vmalloc_or_module_addr((void *) va->va_start))
2284 kasan_release_vmalloc(va->va_start, va->va_end,
2285 va->va_start, va->va_end,
2366 struct vmap_area, list)->va_start);
2442 unsigned long va_start = va->va_start;
2458 id_to_node(vn_id):addr_to_node(va->va_start);
2464 trace_free_vmap_area_noflush(va_start, nr_lazy, nr_lazy_max);
2476 flush_cache_vunmap(va->va_start, va->va_end);
2477 vunmap_range_noflush(va->va_start, va->va_end);
2479 flush_tlb_kernel_range(va->va_start, va->va_end);
2496 * addr is not the same as va->va_start, what is not common, we
2680 static void *vmap_block_vaddr(unsigned long va_start, unsigned long pages_off)
2684 addr = va_start + (pages_off << PAGE_SHIFT);
2685 BUG_ON(addr_to_vb_idx(addr) != addr_to_vb_idx(va_start));
2722 vaddr = vmap_block_vaddr(va->va_start, 0);
2736 xa = addr_to_vb_xa(va->va_start);
2737 vb_idx = addr_to_vb_idx(va->va_start);
2765 xa = addr_to_vb_xa(vb->va->va_start);
2766 tmp = xa_erase(xa, addr_to_vb_idx(vb->va->va_start));
2769 vn = addr_to_node(vb->va->va_start);
2879 vaddr = vmap_block_vaddr(vb->va->va_start, pages_off);
2969 unsigned long va_start = vb->va->va_start;
2972 s = va_start + (vb->dirty_min << PAGE_SHIFT);
2973 e = va_start + (vb->dirty_max << PAGE_SHIFT);
3043 debug_check_no_locks_freed((void *)va->va_start, va_size(va));
3082 addr = va->va_start;
4605 start = vmap_block_vaddr(vb->va->va_start, rs);
4690 if ((unsigned long)addr + remains <= va->va_start)
4716 vaddr = (char *) va->va_start;
4887 * i.e. va->va_start < addr && va->va_end < addr or NULL
4901 if (tmp->va_start <= addr) {
4935 if ((*va)->va_start < addr)
5056 if (base + start < va->va_start) {
5096 va->va_start = start;
5104 if (kasan_populate_vmalloc(vas[area]->va_start, sizes[area], GFP_KERNEL))
5110 struct vmap_node *vn = addr_to_node(vas[area]->va_start);
5138 orig_start = vas[area]->va_start;
5144 va->va_start, va->va_end,
5189 orig_start = vas[area]->va_start;
5195 va->va_start, va->va_end,
5293 (void *)va->va_start, (void *)va->va_end,
5316 (void *)va->va_start, (void *)va->va_end,
5405 free->va_start = vmap_start;
5420 free->va_start = vmap_start;
5547 va->va_start = (unsigned long)tmp->addr;
5548 va->va_end = va->va_start + tmp->size;
5551 vn = addr_to_node(va->va_start);