289 	struct rb_node *n = vmap_area_root.rb_node;  in __find_vmap_area()  local
291 	while (n) {  in __find_vmap_area()
294 		va = rb_entry(n, struct vmap_area, rb_node);  in __find_vmap_area()
296 			n = n->rb_left;  in __find_vmap_area()
298 			n = n->rb_right;  in __find_vmap_area()
350 	struct rb_node *n;  in alloc_vmap_area()  local
407 		n = vmap_area_root.rb_node;  in alloc_vmap_area()
410 		while (n) {  in alloc_vmap_area()
412 			tmp = rb_entry(n, struct vmap_area, rb_node);  in alloc_vmap_area()
417 				n = n->rb_left;  in alloc_vmap_area()
419 				n = n->rb_right;  in alloc_vmap_area()
1984 	unsigned long n;  in vread()  local
2010 		n = vaddr + get_vm_area_size(vm) - addr;  in vread()
2011 		if (n > count)  in vread()
2012 			n = count;  in vread()
2014 			aligned_vread(buf, addr, n);  in vread()
2016 			memset(buf, 0, n);  in vread()
2017 		buf += n;  in vread()
2018 		addr += n;  in vread()
2019 		count -= n;  in vread()
2064 	unsigned long n, buflen;  in vwrite()  local
2091 		n = vaddr + get_vm_area_size(vm) - addr;  in vwrite()
2092 		if (n > count)  in vwrite()
2093 			n = count;  in vwrite()
2095 			aligned_vwrite(buf, addr, n);  in vwrite()
2098 		buf += n;  in vwrite()
2099 		addr += n;  in vwrite()
2100 		count -= n;  in vwrite()
2254 static struct vmap_area *node_to_va(struct rb_node *n)  in node_to_va()  argument
2256 	return n ? rb_entry(n, struct vmap_area, rb_node) : NULL;  in node_to_va()
2275 	struct rb_node *n = vmap_area_root.rb_node;  in pvm_find_next_prev()  local
2278 	while (n) {  in pvm_find_next_prev()
2279 		va = rb_entry(n, struct vmap_area, rb_node);  in pvm_find_next_prev()
2281 			n = n->rb_left;  in pvm_find_next_prev()
2283 			n = n->rb_right;  in pvm_find_next_prev()
2536 	loff_t n = *pos;  in s_start()  local
2541 	while (n > 0 && &va->list != &vmap_area_list) {  in s_start()
2542 		n--;  in s_start()
2545 	if (!n && &va->list != &vmap_area_list)  in s_start()