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);
  60void memblock_trim_memory(phys_addr_t align);
  61
  62#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
  63void __next_mem_pfn_range(int *idx, int nid, unsigned long *out_start_pfn,
  64                          unsigned long *out_end_pfn, int *out_nid);
  65
  66/**
  67 * for_each_mem_pfn_range - early memory pfn range iterator
  68 * @i: an integer used as loop variable
  69 * @nid: node selector, %MAX_NUMNODES for all nodes
  70 * @p_start: ptr to ulong for start pfn of the range, can be %NULL
  71 * @p_end: ptr to ulong for end pfn of the range, can be %NULL
  72 * @p_nid: ptr to int for nid of the range, can be %NULL
  73 *
  74 * Walks over configured memory ranges.  Available after early_node_map is
  75 * populated.
  76 */
  77#define for_each_mem_pfn_range(i, nid, p_start, p_end, p_nid)           \
  78        for (i = -1, __next_mem_pfn_range(&i, nid, p_start, p_end, p_nid); \
  79             i >= 0; __next_mem_pfn_range(&i, nid, p_start, p_end, p_nid))
  80#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
  81
  82void __next_free_mem_range(u64 *idx, int nid, phys_addr_t *out_start,
  83                           phys_addr_t *out_end, int *out_nid);
  84
  85/**
  86 * for_each_free_mem_range - iterate through free memblock areas
  87 * @i: u64 used as loop variable
  88 * @nid: node selector, %MAX_NUMNODES for all nodes
  89 * @p_start: ptr to phys_addr_t for start address of the range, can be %NULL
  90 * @p_end: ptr to phys_addr_t for end address of the range, can be %NULL
  91 * @p_nid: ptr to int for nid of the range, can be %NULL
  92 *
  93 * Walks over free (memory && !reserved) areas of memblock.  Available as
  94 * soon as memblock is initialized.
  95 */
  96#define for_each_free_mem_range(i, nid, p_start, p_end, p_nid)          \
  97        for (i = 0,                                                     \
  98             __next_free_mem_range(&i, nid, p_start, p_end, p_nid);     \
  99             i != (u64)ULLONG_MAX;                                      \
 100             __next_free_mem_range(&i, nid, p_start, p_end, p_nid))
 101
 102void __next_free_mem_range_rev(u64 *idx, int nid, phys_addr_t *out_start,
 103                               phys_addr_t *out_end, int *out_nid);
 104
 105/**
 106 * for_each_free_mem_range_reverse - rev-iterate through free memblock areas
 107 * @i: u64 used as loop variable
 108 * @nid: node selector, %MAX_NUMNODES for all nodes
 109 * @p_start: ptr to phys_addr_t for start address of the range, can be %NULL
 110 * @p_end: ptr to phys_addr_t for end address of the range, can be %NULL
 111 * @p_nid: ptr to int for nid of the range, can be %NULL
 112 *
 113 * Walks over free (memory && !reserved) areas of memblock in reverse
 114 * order.  Available as soon as memblock is initialized.
 115 */
 116#define for_each_free_mem_range_reverse(i, nid, p_start, p_end, p_nid)  \
 117        for (i = (u64)ULLONG_MAX,                                       \
 118             __next_free_mem_range_rev(&i, nid, p_start, p_end, p_nid); \
 119             i != (u64)ULLONG_MAX;                                      \
 120             __next_free_mem_range_rev(&i, nid, p_start, p_end, p_nid))
 121
 122#ifdef CONFIG_HAVE_MEMBLOCK_NODE_MAP
 123int memblock_set_node(phys_addr_t base, phys_addr_t size, int nid);
 124
 125static inline void memblock_set_region_node(struct memblock_region *r, int nid)
 126{
 127        r->nid = nid;
 128}
 129
 130static inline int memblock_get_region_node(const struct memblock_region *r)
 131{
 132        return r->nid;
 133}
 134#else
 135static inline void memblock_set_region_node(struct memblock_region *r, int nid)
 136{
 137}
 138
 139static inline int memblock_get_region_node(const struct memblock_region *r)
 140{
 141        return 0;
 142}
 143#endif /* CONFIG_HAVE_MEMBLOCK_NODE_MAP */
 144
 145phys_addr_t memblock_alloc_nid(phys_addr_t size, phys_addr_t align, int nid);
 146phys_addr_t memblock_alloc_try_nid(phys_addr_t size, phys_addr_t align, int nid);
 147
 148phys_addr_t memblock_alloc(phys_addr_t size, phys_addr_t align);
 149
 150/* Flags for memblock_alloc_base() amd __memblock_alloc_base() */
 151#define MEMBLOCK_ALLOC_ANYWHERE (~(phys_addr_t)0)
 152#define MEMBLOCK_ALLOC_ACCESSIBLE       0
 153
 154phys_addr_t memblock_alloc_base(phys_addr_t size, phys_addr_t align,
 155                                phys_addr_t max_addr);
 156phys_addr_t __memblock_alloc_base(phys_addr_t size, phys_addr_t align,
 157                                  phys_addr_t max_addr);
 158phys_addr_t memblock_phys_mem_size(void);
 159phys_addr_t memblock_start_of_DRAM(void);
 160phys_addr_t memblock_end_of_DRAM(void);
 161void memblock_enforce_memory_limit(phys_addr_t memory_limit);
 162int memblock_is_memory(phys_addr_t addr);
 163int memblock_is_region_memory(phys_addr_t base, phys_addr_t size);
 164int memblock_is_reserved(phys_addr_t addr);
 165int memblock_is_region_reserved(phys_addr_t base, phys_addr_t size);
 166
 167extern void __memblock_dump_all(void);
 168
 169static inline void memblock_dump_all(void)
 170{
 171        if (memblock_debug)
 172                __memblock_dump_all();
 173}
 174
 175/**
 176 * memblock_set_current_limit - Set the current allocation limit to allow
 177 *                         limiting allocations to what is currently
 178 *                         accessible during boot
 179 * @limit: New limit value (physical address)
 180 */
 181void memblock_set_current_limit(phys_addr_t limit);
 182
 183
 184/*
 185 * pfn conversion functions
 186 *
 187 * While the memory MEMBLOCKs should always be page aligned, the reserved
 188 * MEMBLOCKs may not be. This accessor attempt to provide a very clear
 189 * idea of what they return for such non aligned MEMBLOCKs.
 190 */
 191
 192/**
 193 * memblock_region_memory_base_pfn - Return the lowest pfn intersecting with the memory region
 194 * @reg: memblock_region structure
 195 */
 196static inline unsigned long memblock_region_memory_base_pfn(const struct memblock_region *reg)
 197{
 198        return PFN_UP(reg->base);
 199}
 200
 201/**
 202 * memblock_region_memory_end_pfn - Return the end_pfn this region
 203 * @reg: memblock_region structure
 204 */
 205static inline unsigned long memblock_region_memory_end_pfn(const struct memblock_region *reg)
 206{
 207        return PFN_DOWN(reg->base + reg->size);
 208}
 209
 210/**
 211 * memblock_region_reserved_base_pfn - Return the lowest pfn intersecting with the reserved region
 212 * @reg: memblock_region structure
 213 */
 214static inline unsigned long memblock_region_reserved_base_pfn(const struct memblock_region *reg)
 215{
 216        return PFN_DOWN(reg->base);
 217}
 218
 219/**
 220 * memblock_region_reserved_end_pfn - Return the end_pfn this region
 221 * @reg: memblock_region structure
 222 */
 223static inline unsigned long memblock_region_reserved_end_pfn(const struct memblock_region *reg)
 224{
 225        return PFN_UP(reg->base + reg->size);
 226}
 227
 228#define for_each_memblock(memblock_type, region)                                        \
 229        for (region = memblock.memblock_type.regions;                           \
 230             region < (memblock.memblock_type.regions + memblock.memblock_type.cnt);    \
 231             region++)
 232
 233
 234#ifdef CONFIG_ARCH_DISCARD_MEMBLOCK
 235#define __init_memblock __meminit
 236#define __initdata_memblock __meminitdata
 237#else
 238#define __init_memblock
 239#define __initdata_memblock
 240#endif
 241
 242#else
 243static inline phys_addr_t memblock_alloc(phys_addr_t size, phys_addr_t align)
 244{
 245        return 0;
 246}
 247
 248#endif /* CONFIG_HAVE_MEMBLOCK */
 249
 250#endif /* __KERNEL__ */
 251
 252#endif /* _LINUX_MEMBLOCK_H */
 253
lxr.linux.no kindly hosted by Redpill Linpro AS, provider of Linux consulting and operations services since 1995.