gfp.h File Reference

#include <linux/list.h>
#include <nvhe/memory.h>
#include <nvhe/spinlock.h>

Include dependency graph for gfp.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	hyp_pool

Macros
#define	HYP_NO_ORDER   USHRT_MAX

Functions
void *	hyp_alloc_pages (struct hyp_pool *pool, unsigned short order)
void	hyp_split_page (struct hyp_page *page)
void	hyp_get_page (struct hyp_pool *pool, void *addr)
void	hyp_put_page (struct hyp_pool *pool, void *addr)
int	hyp_pool_init (struct hyp_pool *pool, u64 pfn, unsigned int nr_pages, unsigned int reserved_pages)

Macro Definition Documentation

HYP_NO_ORDER

#define HYP_NO_ORDER   USHRT_MAX

Definition at line 10 of file gfp.h.

Function Documentation

hyp_alloc_pages()

void* hyp_alloc_pages	(	struct hyp_pool *	pool,
		unsigned short	order
	)

Definition at line 198 of file page_alloc.c.

{
    unsigned short i = order;
    struct hyp_page *p;
 
    hyp_spin_lock(&pool->lock);
 
    /* Look for a high-enough-order page */
    while (i <= pool->max_order && list_empty(&pool->free_area[i]))
        i++;
    if (i > pool->max_order) {
        hyp_spin_unlock(&pool->lock);
        return NULL;
    }
 
    /* Extract it from the tree at the right order */
    p = node_to_page(pool->free_area[i].next);
    p = __hyp_extract_page(pool, p, order);
 
    hyp_set_page_refcounted(p);
    hyp_spin_unlock(&pool->lock);
 
    return hyp_page_to_virt(p);
}

Here is the call graph for this function:

Here is the caller graph for this function:

hyp_get_page()

void hyp_get_page	(	struct hyp_pool *	pool,
		void *	addr
	)

Definition at line 175 of file page_alloc.c.

{
    struct hyp_page *p = hyp_virt_to_page(addr);
 
    hyp_spin_lock(&pool->lock);
    hyp_page_ref_inc(p);
    hyp_spin_unlock(&pool->lock);
}

Here is the call graph for this function:

Here is the caller graph for this function:

hyp_pool_init()

int hyp_pool_init	(	struct hyp_pool *	pool,
		u64	pfn,
		unsigned int	nr_pages,
		unsigned int	reserved_pages
	)

Definition at line 223 of file page_alloc.c.

{
    phys_addr_t phys = hyp_pfn_to_phys(pfn);
    struct hyp_page *p;
    int i;
 
    hyp_spin_lock_init(&pool->lock);
    pool->max_order = min(MAX_PAGE_ORDER,
                  get_order(nr_pages << PAGE_SHIFT));
    for (i = 0; i <= pool->max_order; i++)
        INIT_LIST_HEAD(&pool->free_area[i]);
    pool->range_start = phys;
    pool->range_end = phys + (nr_pages << PAGE_SHIFT);
 
    /* Init the vmemmap portion */
    p = hyp_phys_to_page(phys);
    for (i = 0; i < nr_pages; i++)
        hyp_set_page_refcounted(&p[i]);
 
    /* Attach the unused pages to the buddy tree */
    for (i = reserved_pages; i < nr_pages; i++)
        __hyp_put_page(pool, &p[i]);
 
    return 0;
}

Here is the call graph for this function:

Here is the caller graph for this function:

hyp_put_page()

void hyp_put_page	(	struct hyp_pool *	pool,
		void *	addr
	)

Definition at line 166 of file page_alloc.c.

{
    struct hyp_page *p = hyp_virt_to_page(addr);
 
    hyp_spin_lock(&pool->lock);
    __hyp_put_page(pool, p);
    hyp_spin_unlock(&pool->lock);
}

Here is the call graph for this function:

Here is the caller graph for this function:

hyp_split_page()

void hyp_split_page

(

struct hyp_page *

page

)

Definition at line 184 of file page_alloc.c.

{
    unsigned short order = p->order;
    unsigned int i;
 
    p->order = 0;
    for (i = 1; i < (1 << order); i++) {
        struct hyp_page *tail = p + i;
 
        tail->order = 0;
        hyp_set_page_refcounted(tail);
    }
}

Here is the call graph for this function:

Here is the caller graph for this function: