The Design and Implementation of the FreeBSD Operating System, Second Edition
Now available: The Design and Implementation of the FreeBSD Operating System (Second Edition)


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]

FreeBSD/Linux Kernel Cross Reference
sys/kern/subr_physmem.c

Version: -  FREEBSD  -  FREEBSD-13-STABLE  -  FREEBSD-13-0  -  FREEBSD-12-STABLE  -  FREEBSD-12-0  -  FREEBSD-11-STABLE  -  FREEBSD-11-0  -  FREEBSD-10-STABLE  -  FREEBSD-10-0  -  FREEBSD-9-STABLE  -  FREEBSD-9-0  -  FREEBSD-8-STABLE  -  FREEBSD-8-0  -  FREEBSD-7-STABLE  -  FREEBSD-7-0  -  FREEBSD-6-STABLE  -  FREEBSD-6-0  -  FREEBSD-5-STABLE  -  FREEBSD-5-0  -  FREEBSD-4-STABLE  -  FREEBSD-3-STABLE  -  FREEBSD22  -  l41  -  OPENBSD  -  linux-2.6  -  MK84  -  PLAN9  -  xnu-8792 
SearchContext: -  none  -  3  -  10 

    1 /*-
    2  * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
    3  *
    4  * Copyright (c) 2014 Ian Lepore <ian@freebsd.org>
    5  * All rights reserved.
    6  *
    7  * Redistribution and use in source and binary forms, with or without
    8  * modification, are permitted provided that the following conditions
    9  * are met:
   10  * 1. Redistributions of source code must retain the above copyright
   11  *    notice, this list of conditions and the following disclaimer.
   12  * 2. Redistributions in binary form must reproduce the above copyright
   13  *    notice, this list of conditions and the following disclaimer in the
   14  *    documentation and/or other materials provided with the distribution.
   15  *
   16  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
   17  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
   18  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
   19  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
   20  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
   21  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
   22  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
   23  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
   24  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
   25  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
   26  * SUCH DAMAGE.
   27  */
   28 
   29 #include <sys/cdefs.h>
   30 __FBSDID("$FreeBSD$");
   31 
   32 #ifdef _KERNEL
   33 #include "opt_acpi.h"
   34 #include "opt_ddb.h"
   35 #endif
   36 
   37 /*
   38  * Routines for describing and initializing anything related to physical memory.
   39  */
   40 
   41 #include <sys/param.h>
   42 #include <sys/systm.h>
   43 #include <sys/kernel.h>
   44 #include <sys/physmem.h>
   45 
   46 #ifdef _KERNEL
   47 #include <vm/vm.h>
   48 #include <vm/vm_param.h>
   49 #include <vm/vm_page.h>
   50 #include <vm/vm_phys.h>
   51 #include <vm/vm_dumpset.h>
   52 #include <machine/md_var.h>
   53 #else
   54 #include <stdarg.h>
   55 #include <stdio.h>
   56 #include <string.h>
   57 #endif
   58 
   59 /*
   60  * These structures are used internally to keep track of regions of physical
   61  * ram, and regions within the physical ram that need to be excluded.  An
   62  * exclusion region can be excluded from crash dumps, from the vm pool of pages
   63  * that can be allocated, or both, depending on the exclusion flags associated
   64  * with the region.
   65  */
   66 #ifdef DEV_ACPI
   67 #define MAX_HWCNT       32      /* ACPI needs more regions */
   68 #define MAX_EXCNT       32
   69 #else
   70 #define MAX_HWCNT       16
   71 #define MAX_EXCNT       16
   72 #endif
   73 
   74 #if defined(__arm__)
   75 #define MAX_PHYS_ADDR   0xFFFFFFFFull
   76 #elif defined(__aarch64__) || defined(__amd64__) || defined(__riscv)
   77 #define MAX_PHYS_ADDR   0xFFFFFFFFFFFFFFFFull
   78 #endif
   79 
   80 struct region {
   81         vm_paddr_t      addr;
   82         vm_size_t       size;
   83         uint32_t        flags;
   84 };
   85 
   86 static struct region hwregions[MAX_HWCNT];
   87 static struct region exregions[MAX_EXCNT];
   88 
   89 static size_t hwcnt;
   90 static size_t excnt;
   91 
   92 /*
   93  * realmem is the total number of hardware pages, excluded or not.
   94  * Maxmem is one greater than the last physical page number.
   95  */
   96 long realmem;
   97 long Maxmem;
   98 
   99 #ifndef _KERNEL
  100 static void
  101 panic(const char *fmt, ...)
  102 {
  103         va_list va;
  104 
  105         va_start(va, fmt);
  106         vfprintf(stderr, fmt, va);
  107         fprintf(stderr, "\n");
  108         va_end(va);
  109         __builtin_trap();
  110 }
  111 #endif
  112 
  113 /*
  114  * Print the contents of the physical and excluded region tables using the
  115  * provided printf-like output function (which will be either printf or
  116  * db_printf).
  117  */
  118 static void
  119 physmem_dump_tables(int (*prfunc)(const char *, ...))
  120 {
  121         size_t i;
  122         int flags;
  123         uintmax_t addr, size;
  124         const unsigned int mbyte = 1024 * 1024;
  125 
  126         prfunc("Physical memory chunk(s):\n");
  127         for (i = 0; i < hwcnt; ++i) {
  128                 addr = hwregions[i].addr;
  129                 size = hwregions[i].size;
  130                 prfunc("  0x%08jx - 0x%08jx, %5ju MB (%7ju pages)\n", addr,
  131                     addr + size - 1, size / mbyte, size / PAGE_SIZE);
  132         }
  133 
  134         prfunc("Excluded memory regions:\n");
  135         for (i = 0; i < excnt; ++i) {
  136                 addr  = exregions[i].addr;
  137                 size  = exregions[i].size;
  138                 flags = exregions[i].flags;
  139                 prfunc("  0x%08jx - 0x%08jx, %5ju MB (%7ju pages) %s %s\n",
  140                     addr, addr + size - 1, size / mbyte, size / PAGE_SIZE,
  141                     (flags & EXFLAG_NOALLOC) ? "NoAlloc" : "",
  142                     (flags & EXFLAG_NODUMP)  ? "NoDump" : "");
  143         }
  144 
  145 #ifdef DEBUG
  146         prfunc("Avail lists:\n");
  147         for (i = 0; phys_avail[i] != 0; ++i) {
  148                 prfunc("  phys_avail[%d] 0x%08x\n", i, phys_avail[i]);
  149         }
  150         for (i = 0; dump_avail[i] != 0; ++i) {
  151                 prfunc("  dump_avail[%d] 0x%08x\n", i, dump_avail[i]);
  152         }
  153 #endif
  154 }
  155 
  156 /*
  157  * Print the contents of the static mapping table.  Used for bootverbose.
  158  */
  159 void
  160 physmem_print_tables(void)
  161 {
  162 
  163         physmem_dump_tables(printf);
  164 }
  165 
  166 /*
  167  * Walk the list of hardware regions, processing it against the list of
  168  * exclusions that contain the given exflags, and generating an "avail list".
  169  * 
  170  * If maxphyssz is not zero it sets upper limit, in bytes, for the total
  171  * "avail list" size. Walk stops once the limit is reached and the last region
  172  * is cut short if necessary.
  173  *
  174  * Updates the value at *pavail with the sum of all pages in all hw regions.
  175  *
  176  * Returns the number of pages of non-excluded memory added to the avail list.
  177  */
  178 static size_t
  179 regions_to_avail(vm_paddr_t *avail, uint32_t exflags, size_t maxavail,
  180     uint64_t maxphyssz, long *pavail, long *prealmem)
  181 {
  182         size_t acnt, exi, hwi;
  183         uint64_t adj, end, start, xend, xstart;
  184         long availmem, totalmem;
  185         const struct region *exp, *hwp;
  186         uint64_t availsz;
  187 
  188         totalmem = 0;
  189         availmem = 0;
  190         availsz = 0;
  191         acnt = 0;
  192         for (hwi = 0, hwp = hwregions; hwi < hwcnt; ++hwi, ++hwp) {
  193                 adj   = round_page(hwp->addr) - hwp->addr;
  194                 start = round_page(hwp->addr);
  195                 end   = trunc_page(hwp->size + adj) + start;
  196                 totalmem += atop((vm_offset_t)(end - start));
  197                 for (exi = 0, exp = exregions; exi < excnt; ++exi, ++exp) {
  198                         /*
  199                          * If the excluded region does not match given flags,
  200                          * continue checking with the next excluded region.
  201                          */
  202                         if ((exp->flags & exflags) == 0)
  203                                 continue;
  204                         xstart = exp->addr;
  205                         xend   = exp->size + xstart;
  206                         /*
  207                          * If the excluded region ends before this hw region,
  208                          * continue checking with the next excluded region.
  209                          */
  210                         if (xend <= start)
  211                                 continue;
  212                         /*
  213                          * If the excluded region begins after this hw region
  214                          * we're done because both lists are sorted.
  215                          */
  216                         if (xstart >= end)
  217                                 break;
  218                         /*
  219                          * If the excluded region completely covers this hw
  220                          * region, shrink this hw region to zero size.
  221                          */
  222                         if ((start >= xstart) && (end <= xend)) {
  223                                 start = xend;
  224                                 end = xend;
  225                                 break;
  226                         }
  227                         /*
  228                          * If the excluded region falls wholly within this hw
  229                          * region without abutting or overlapping the beginning
  230                          * or end, create an available entry from the leading
  231                          * fragment, then adjust the start of this hw region to
  232                          * the end of the excluded region, and continue checking
  233                          * the next excluded region because another exclusion
  234                          * could affect the remainder of this hw region.
  235                          */
  236                         if ((xstart > start) && (xend < end)) {
  237 
  238                                 if ((maxphyssz != 0) &&
  239                                     (availsz + xstart - start > maxphyssz)) {
  240                                         xstart = maxphyssz + start - availsz;
  241                                 }
  242                                 if (xstart <= start)
  243                                         continue;
  244                                 if (acnt > 0 &&
  245                                     avail[acnt - 1] == (vm_paddr_t)start) {
  246                                         avail[acnt - 1] = (vm_paddr_t)xstart;
  247                                 } else {
  248                                         avail[acnt++] = (vm_paddr_t)start;
  249                                         avail[acnt++] = (vm_paddr_t)xstart;
  250                                 }
  251                                 availsz += (xstart - start);
  252                                 availmem += atop((vm_offset_t)(xstart - start));
  253                                 start = xend;
  254                                 continue;
  255                         }
  256                         /*
  257                          * We know the excluded region overlaps either the start
  258                          * or end of this hardware region (but not both), trim
  259                          * the excluded portion off the appropriate end.
  260                          */
  261                         if (xstart <= start)
  262                                 start = xend;
  263                         else
  264                                 end = xstart;
  265                 }
  266                 /*
  267                  * If the trimming actions above left a non-zero size, create an
  268                  * available entry for it.
  269                  */
  270                 if (end > start) {
  271                         if ((maxphyssz != 0) &&
  272                             (availsz + end - start > maxphyssz)) {
  273                                 end = maxphyssz + start - availsz;
  274                         }
  275                         if (end <= start)
  276                                 break;
  277 
  278                         if (acnt > 0 && avail[acnt - 1] == (vm_paddr_t)start) {
  279                                 avail[acnt - 1] = (vm_paddr_t)end;
  280                         } else {
  281                                 avail[acnt++] = (vm_paddr_t)start;
  282                                 avail[acnt++] = (vm_paddr_t)end;
  283                         }
  284                         availsz += end - start;
  285                         availmem += atop((vm_offset_t)(end - start));
  286                 }
  287                 if (acnt >= maxavail)
  288                         panic("Not enough space in the dump/phys_avail arrays");
  289         }
  290 
  291         if (pavail != NULL)
  292                 *pavail = availmem;
  293         if (prealmem != NULL)
  294                 *prealmem = totalmem;
  295         return (acnt);
  296 }
  297 
  298 /*
  299  * Insertion-sort a new entry into a regions list; sorted by start address.
  300  */
  301 static size_t
  302 insert_region(struct region *regions, size_t rcnt, vm_paddr_t addr,
  303     vm_size_t size, uint32_t flags)
  304 {
  305         size_t i;
  306         struct region *ep, *rp;
  307 
  308         ep = regions + rcnt;
  309         for (i = 0, rp = regions; i < rcnt; ++i, ++rp) {
  310                 if (rp->addr == addr && rp->size == size) /* Pure dup. */
  311                         return (rcnt);
  312                 if (flags == rp->flags) {
  313                         if (addr + size == rp->addr) {
  314                                 rp->addr = addr;
  315                                 rp->size += size;
  316                                 return (rcnt);
  317                         } else if (rp->addr + rp->size == addr) {
  318                                 rp->size += size;
  319                                 return (rcnt);
  320                         }
  321                 }
  322                 if (addr < rp->addr) {
  323                         bcopy(rp, rp + 1, (ep - rp) * sizeof(*rp));
  324                         break;
  325                 }
  326         }
  327         rp->addr  = addr;
  328         rp->size  = size;
  329         rp->flags = flags;
  330         rcnt++;
  331 
  332         return (rcnt);
  333 }
  334 
  335 /*
  336  * Add a hardware memory region.
  337  */
  338 void
  339 physmem_hardware_region(uint64_t pa, uint64_t sz)
  340 {
  341         /*
  342          * Filter out the page at PA 0x00000000.  The VM can't handle it, as
  343          * pmap_extract() == 0 means failure.
  344          */
  345         if (pa == 0) {
  346                 if (sz <= PAGE_SIZE)
  347                         return;
  348                 pa  = PAGE_SIZE;
  349                 sz -= PAGE_SIZE;
  350         } else if (pa > MAX_PHYS_ADDR) {
  351                 /* This range is past usable memory, ignore it */
  352                 return;
  353         }
  354 
  355         /*
  356          * Also filter out the page at the end of the physical address space --
  357          * if addr is non-zero and addr+size is zero we wrapped to the next byte
  358          * beyond what vm_paddr_t can express.  That leads to a NULL pointer
  359          * deref early in startup; work around it by leaving the last page out.
  360          *
  361          * XXX This just in:  subtract out a whole megabyte, not just 1 page.
  362          * Reducing the size by anything less than 1MB results in the NULL
  363          * pointer deref in _vm_map_lock_read().  Better to give up a megabyte
  364          * than leave some folks with an unusable system while we investigate.
  365          */
  366         if ((pa + sz) > (MAX_PHYS_ADDR - 1024 * 1024)) {
  367                 sz = MAX_PHYS_ADDR - pa + 1;
  368                 if (sz <= 1024 * 1024)
  369                         return;
  370                 sz -= 1024 * 1024;
  371         }
  372 
  373         if (sz > 0 && hwcnt < nitems(hwregions))
  374                 hwcnt = insert_region(hwregions, hwcnt, pa, sz, 0);
  375 }
  376 
  377 /*
  378  * Add an exclusion region.
  379  */
  380 void
  381 physmem_exclude_region(vm_paddr_t pa, vm_size_t sz, uint32_t exflags)
  382 {
  383         vm_offset_t adj;
  384 
  385         /*
  386          * Truncate the starting address down to a page boundary, and round the
  387          * ending page up to a page boundary.
  388          */
  389         adj = pa - trunc_page(pa);
  390         pa  = trunc_page(pa);
  391         sz  = round_page(sz + adj);
  392 
  393         if (excnt >= nitems(exregions))
  394                 panic("failed to exclude region %#jx-%#jx", (uintmax_t)pa,
  395                     (uintmax_t)(pa + sz));
  396         excnt = insert_region(exregions, excnt, pa, sz, exflags);
  397 }
  398 
  399 size_t
  400 physmem_avail(vm_paddr_t *avail, size_t maxavail)
  401 {
  402 
  403         return (regions_to_avail(avail, EXFLAG_NOALLOC, maxavail, 0, NULL, NULL));
  404 }
  405 
  406 #ifdef _KERNEL
  407 /*
  408  * Process all the regions added earlier into the global avail lists.
  409  *
  410  * Updates the kernel global 'physmem' with the number of physical pages
  411  * available for use (all pages not in any exclusion region).
  412  *
  413  * Updates the kernel global 'Maxmem' with the page number one greater then the
  414  * last page of physical memory in the system.
  415  */
  416 void
  417 physmem_init_kernel_globals(void)
  418 {
  419         size_t nextidx;
  420         u_long hwphyssz;
  421 
  422         hwphyssz = 0;
  423         TUNABLE_ULONG_FETCH("hw.physmem", &hwphyssz);
  424 
  425         regions_to_avail(dump_avail, EXFLAG_NODUMP, PHYS_AVAIL_ENTRIES,
  426             hwphyssz, NULL, NULL);
  427         nextidx = regions_to_avail(phys_avail, EXFLAG_NOALLOC,
  428             PHYS_AVAIL_ENTRIES, hwphyssz, &physmem, &realmem);
  429         if (nextidx == 0)
  430                 panic("No memory entries in phys_avail");
  431         Maxmem = atop(phys_avail[nextidx - 1]);
  432 }
  433 #endif
  434 
  435 #ifdef DDB
  436 #include <ddb/ddb.h>
  437 
  438 DB_SHOW_COMMAND(physmem, db_show_physmem)
  439 {
  440 
  441         physmem_dump_tables(db_printf);
  442 }
  443 
  444 #endif /* DDB */

Cache object: 4aad56bad1d45f33116fec3e22e5178d


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]


This page is part of the FreeBSD/Linux Linux Kernel Cross-Reference, and was automatically generated using a modified version of the LXR engine.