linux-master/mm/vmalloc.c

816  * allocating from slab we reuse an object from this cache to
842  * aim is to get rid of allocations from the atomic context, thus
1105 	struct rb_root *root, struct rb_node *from,
1118 		link = &from;
1190 		 * It is because we populate the tree from the bottom
1280  * This function populates subtree_max_size from bottom to upper
1281  * levels starting from VA point. The propagation must be done
1310 	 * Populate the tree from bottom towards the root until
1335 	struct rb_node *from, struct rb_root *root,
1341 	if (from)
1342 		link = find_va_links(va, NULL, from, &parent);
1499 	/* Start from the root. */
1802 	 * Remove from the busy tree/list.
1974 	 * If a VA is obtained from a global heap(if it fails here)
2883  * from the vmap layer.
3285 	 * Use raw_cpu_ptr() because this can be called from preemptible
3299  * from one of the vmalloc() family of APIs.  This will usually also free the
3306  * May sleep if called *not* from interrupt context.
3360  * which was created from the page array passed to vmap().
3390  * Maps @count pages from @pages into contiguous kernel virtual space.
3393  * are transferred from the caller to vmap(), and will be freed / dropped when
3469  * Maps @count PFNs from @pfns into contiguous kernel virtual space and returns
3723  * Allocate enough pages to cover @size from the page level
3875  * Allocate enough pages to cover @size from the page level allocator with
3912  * Allocate enough pages to cover @size from the page level
3932  * Allocate enough pages to cover @size from the page level
3951  * Allocate enough pages to cover @size from the page level
3990  * Allocate enough pages to cover @size from the page level
4010  * Allocate enough pages to cover @size from the page level
4039  * Allocate enough 32bit PA addressable pages to cover @size from the
4093  * small helper routine, copy contents to iter from addr.
4138  * Read from a vm_map_ram region of memory.
4196 		/*it could start reading from the middle of used region*/
4229  * copy data from that area to a given buffer. If the given memory range
4352  * @pgoff:		offset from @kaddr to start at
4525  * areas are allocated from top.
4528  * does everything top-down and scans free blocks from the end looking
4588 	/* start scanning - we scan from the top, begin with the last area */
4702 	 * need in removing these areas from the busy tree,