linux/include/linux/memblock.h
<<
>>
Prefs
   1#ifndef _LINUX_MEMBLOCK_H
   2#define _LINUX_MEMBLOCK_H
   3#ifdef __KERNEL__
   4
   5#ifdef CONFIG_HAVE_MEMBLOCK
   6/*
   7 * Logical memory blocks.
   8 *
   9 * Copyright (C) 2001 Peter Bergner, IBM Corp.
  10 *
  11 * This program is free software; you can redistribute it and/or
  12 * modify it under the terms of the GNU General Public License
  13 * as published by the Free Software Foundation; either version
  14 * 2 of the License, or (at your option) any later version.
  15 */
  16
  17#include <linux/init.h>
  18#include <linux/mm.h>
  19
  20#define INIT_MEMBLOCK_REGIONS   128
  21
  22struct memblock_region {
  23        phys_addr_t base;
  24        phys_addr_t size;
  25#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
  26        int nid;
  27#endif
  28};
  29
  30struct memblock_type {
  31        unsigned long cnt;      /* number of regions */
  32        unsigned long max;      /* size of the allocated array */
  33        phys_addr_t total_size; /* size of all regions */
  34        struct memblock_region *regions;
  35};
  36
  37struct memblock {
  38        phys_addr_t current_limit;
  39        struct memblock_type memory;
  40        struct memblock_type reserved;
  41};
  42
  43extern struct memblock memblock;
  44extern int memblock_debug;
  45
  46#define memblock_dbg(fmt, ...) \
  47        if (memblock_debug) printk(KERN_INFO pr_fmt(fmt), ##__VA_ARGS__)
  48
  49phys_addr_t memblock_find_in_range_node(phys_addr_t start, phys_addr_t end,
  50                                phys_addr_t size, phys_addr_t align, int nid);
  51phys_addr_t memblock_find_in_range(phys_addr_t start, phys_addr_t end,
  52                                   phys_addr_t size, phys_addr_t align);
  53phys_addr_t get_allocated_memblock_reserved_regions_info(phys_addr_t *addr);
  54void memblock_allow_resize(void);
  55int memblock_add_node(phys_addr_t base, phys_addr_t size, int nid);
  56int memblock_add(phys_addr_t base, phys_addr_t size);
  57int memblock_remove(phys_addr_t base, phys_addr_t size);
  58int memblock_free(phys_addr_t base, phys_addr_t size);
  59int memblock_reserve(phys_addr_t base, phys_addr_t size);
  60
  61#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
  62void __next_mem_pfn_range(int *idx, int nid, unsigned long *out_start_pfn,
  63                          unsigned long *out_end_pfn, int *out_nid);
  64
  65/**
  66 * for_each_mem_pfn_range - early memory pfn range iterator
  67 * @i: an integer used as loop variable
  68 * @nid: node selector, %MAX_NUMNODES for all nodes
  69 * @p_start: ptr to ulong for start pfn of the range, can be %NULL
  70 * @p_end: ptr to ulong for end pfn of the range, can be %NULL
  71 * @p_nid: ptr to int for nid of the range, can be %NULL
  72 *
  73 * Walks over configured memory ranges.  Available after early_node_map is
  74 * populated.
  75 */
  76#define for_each_mem_pfn_range(i, nid, p_start, p_end, p_nid)           \
  77        for (i = -1, __next_mem_pfn_range(&i, nid, p_start, p_end, p_nid); \
  78             i >= 0; __next_mem_pfn_range(&i, nid, p_start, p_end, p_nid))
  79#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
  80
  81void __next_free_mem_range(u64 *idx, int nid, phys_addr_t *out_start,
  82                           phys_addr_t *out_end, int *out_nid);
  83
  84/**
  85 * for_each_free_mem_range - iterate through free memblock areas
  86 * @i: u64 used as loop variable
  87 * @nid: node selector, %MAX_NUMNODES for all nodes
  88 * @p_start: ptr to phys_addr_t for start address of the range, can be %NULL
  89 * @p_end: ptr to phys_addr_t for end address of the range, can be %NULL
  90 * @p_nid: ptr to int for nid of the range, can be %NULL
  91 *
  92 * Walks over free (memory && !reserved) areas of memblock.  Available as
  93 * soon as memblock is initialized.
  94 */
  95#define for_each_free_mem_range(i, nid, p_start, p_end, p_nid)          \
  96        for (i = 0,                                                     \
  97             __next_free_mem_range(&i, nid, p_start, p_end, p_nid);     \
  98             i != (u64)ULLONG_MAX;                                      \
  99             __next_free_mem_range(&i, nid, p_start, p_end, p_nid))
 100
 101void __next_free_mem_range_rev(u64 *idx, int nid, phys_addr_t *out_start,
 102                               phys_addr_t *out_end, int *out_nid);
 103
 104/**
 105 * for_each_free_mem_range_reverse - rev-iterate through free memblock areas
 106 * @i: u64 used as loop variable
 107 * @nid: node selector, %MAX_NUMNODES for all nodes
 108 * @p_start: ptr to phys_addr_t for start address of the range, can be %NULL
 109 * @p_end: ptr to phys_addr_t for end address of the range, can be %NULL
 110 * @p_nid: ptr to int for nid of the range, can be %NULL
 111 *
 112 * Walks over free (memory && !reserved) areas of memblock in reverse
 113 * order.  Available as soon as memblock is initialized.
 114 */
 115#define for_each_free_mem_range_reverse(i, nid, p_start, p_end, p_nid)  \
 116        for (i = (u64)ULLONG_MAX,                                       \
 117             __next_free_mem_range_rev(&i, nid, p_start, p_end, p_nid); \
 118             i != (u64)ULLONG_MAX;                                      \
 119             __next_free_mem_range_rev(&i, nid, p_start, p_end, p_nid))
 120
 121#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
 122int memblock_set_node(phys_addr_t base, phys_addr_t size, int nid);
 123
 124static inline void memblock_set_region_node(struct memblock_region *r, int nid)
 125{
 126        r->nid = nid;
 127}
 128
 129static inline int memblock_get_region_node(const struct memblock_region *r)
 130{
 131        return r->nid;
 132}
 133#else
 134static inline void memblock_set_region_node(struct memblock_region *r, int nid)
 135{
 136}
 137
 138static inline int memblock_get_region_node(const struct memblock_region *r)
 139{
 140        return 0;
 141}
 142#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
 143
 144phys_addr_t memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid);
 145phys_addr_t memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid);
 146
 147phys_addr_t memblock_alloc(phys_addr_t size, phys_addr_t align);
 148
 149/* Flags for memblock_alloc_base() amd __memblock_alloc_base() */
 150#define MEMBLOCK_ALLOC_ANYWHERE (~(phys_addr_t)0)
 151#define MEMBLOCK_ALLOC_ACCESSIBLE       0
 152
 153phys_addr_t memblock_alloc_base(phys_addr_t size, phys_addr_t align,
 154                                phys_addr_t max_addr);
 155phys_addr_t __memblock_alloc_base(phys_addr_t size, phys_addr_t align,
 156                                  phys_addr_t max_addr);
 157phys_addr_t memblock_phys_mem_size(void);
 158phys_addr_t memblock_start_of_DRAM(void);
 159phys_addr_t memblock_end_of_DRAM(void);
 160void memblock_enforce_memory_limit(phys_addr_t memory_limit);
 161int memblock_is_memory(phys_addr_t addr);
 162int memblock_is_region_memory(phys_addr_t base, phys_addr_t size);
 163int memblock_is_reserved(phys_addr_t addr);
 164int memblock_is_region_reserved(phys_addr_t base, phys_addr_t size);
 165
 166extern void __memblock_dump_all(void);
 167
 168static inline void memblock_dump_all(void)
 169{
 170        if (memblock_debug)
 171                __memblock_dump_all();
 172}
 173
 174/**
 175 * memblock_set_current_limit - Set the current allocation limit to allow
 176 *                         limiting allocations to what is currently
 177 *                         accessible during boot
 178 * @limit: New limit value (physical address)
 179 */
 180void memblock_set_current_limit(phys_addr_t limit);
 181
 182
 183/*
 184 * pfn conversion functions
 185 *
 186 * While the memory MEMBLOCKs should always be page aligned, the reserved
 187 * MEMBLOCKs may not be. This accessor attempt to provide a very clear
 188 * idea of what they return for such non aligned MEMBLOCKs.
 189 */
 190
 191/**
 192 * memblock_region_memory_base_pfn - Return the lowest pfn intersecting with the memory region
 193 * @reg: memblock_region structure
 194 */
 195static inline unsigned long memblock_region_memory_base_pfn(const struct memblock_region *reg)
 196{
 197        return PFN_UP(reg->base);
 198}
 199
 200/**
 201 * memblock_region_memory_end_pfn - Return the end_pfn this region
 202 * @reg: memblock_region structure
 203 */
 204static inline unsigned long memblock_region_memory_end_pfn(const struct memblock_region *reg)
 205{
 206        return PFN_DOWN(reg->base + reg->size);
 207}
 208
 209/**
 210 * memblock_region_reserved_base_pfn - Return the lowest pfn intersecting with the reserved region
 211 * @reg: memblock_region structure
 212 */
 213static inline unsigned long memblock_region_reserved_base_pfn(const struct memblock_region *reg)
 214{
 215        return PFN_DOWN(reg->base);
 216}
 217
 218/**
 219 * memblock_region_reserved_end_pfn - Return the end_pfn this region
 220 * @reg: memblock_region structure
 221 */
 222static inline unsigned long memblock_region_reserved_end_pfn(const struct memblock_region *reg)
 223{
 224        return PFN_UP(reg->base + reg->size);
 225}
 226
 227#define for_each_memblock(memblock_type, region)                                        \
 228        for (region = memblock.memblock_type.regions;                           \
 229             region < (memblock.memblock_type.regions + memblock.memblock_type.cnt);    \
 230             region++)
 231
 232
 233#ifdef CONFIG_ARCH_DISCARD_MEMBLOCK
 234#define __init_memblock __meminit
 235#define __initdata_memblock __meminitdata
 236#else
 237#define __init_memblock
 238#define __initdata_memblock
 239#endif
 240
 241#else
 242static inline phys_addr_t memblock_alloc(phys_addr_t size, phys_addr_t align)
 243{
 244        return 0;
 245}
 246
 247#endif /* CONFIG_HAVE_MEMBLOCK */
 248
 249#endif /* __KERNEL__ */
 250
 251#endif /* _LINUX_MEMBLOCK_H */
 252
lxr.linux.no kindly hosted by Redpill Linpro AS, provider of Linux consulting and operations services since 1995.