mmap.c 13 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
/* Mmap management. */
/*
 *  GRUB  --  GRand Unified Bootloader
 *  Copyright (C) 2009  Free Software Foundation, Inc.
 *
 *  GRUB is free software: you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation, either version 3 of the License, or
 *  (at your option) any later version.
 *
 *  GRUB is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with GRUB.  If not, see <http://www.gnu.org/licenses/>.
 */

#include <grub/memory.h>
21
#include <grub/machine/memory.h>
22 23 24 25 26
#include <grub/err.h>
#include <grub/misc.h>
#include <grub/mm.h>
#include <grub/command.h>
#include <grub/dl.h>
27
#include <grub/i18n.h>
28

29 30
GRUB_MOD_LICENSE ("GPLv3+");

31 32 33 34 35 36 37
#ifndef GRUB_MMAP_REGISTER_BY_FIRMWARE

struct grub_mmap_region *grub_mmap_overlays = 0;
static int curhandle = 1;

#endif

38
static int current_priority = 1;
39 40 41 42 43 44 45 46 47

/* Scanline events. */
struct grub_mmap_scan
{
  /* At which memory address. */
  grub_uint64_t pos;
  /* 0 = region starts, 1 = region ends. */
  int type;
  /* Which type of memory region? */
48 49 50
  grub_memory_type_t memtype;
  /* Priority. 0 means coming from firmware.  */
  int priority;
51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75
};

/* Context for grub_mmap_iterate.  */
struct grub_mmap_iterate_ctx
{
  struct grub_mmap_scan *scanline_events;
  int i;
};

/* Helper for grub_mmap_iterate.  */
static int
count_hook (grub_uint64_t addr __attribute__ ((unused)),
	    grub_uint64_t size __attribute__ ((unused)),
	    grub_memory_type_t type __attribute__ ((unused)), void *data)
{
  int *mmap_num = data;

  (*mmap_num)++;
  return 0;
}

/* Helper for grub_mmap_iterate.  */
static int
fill_hook (grub_uint64_t addr, grub_uint64_t size, grub_memory_type_t type,
	   void *data)
76
{
77
  struct grub_mmap_iterate_ctx *ctx = data;
78

79
  if (type == GRUB_MEMORY_HOLE)
80 81 82
    {
      grub_dprintf ("mmap", "Unknown memory type %d. Assuming unusable\n",
		    type);
83
      type = GRUB_MEMORY_RESERVED;
84
    }
85 86 87 88 89 90

  ctx->scanline_events[ctx->i].pos = addr;
  ctx->scanline_events[ctx->i].type = 0;
  ctx->scanline_events[ctx->i].memtype = type;
  ctx->scanline_events[ctx->i].priority = 0;

91 92 93 94
  ctx->i++;

  ctx->scanline_events[ctx->i].pos = addr + size;
  ctx->scanline_events[ctx->i].type = 1;
95 96
  ctx->scanline_events[ctx->i].memtype = type;
  ctx->scanline_events[ctx->i].priority = 0;
97 98 99 100 101
  ctx->i++;

  return 0;
}

102 103 104 105 106 107 108
struct mm_list
{
  struct mm_list *next;
  grub_memory_type_t val;
  int present;
};

109 110 111
grub_err_t
grub_mmap_iterate (grub_memory_hook_t hook, void *hook_data)
{
112 113 114
  /* This function resolves overlapping regions and sorts the memory map.
     It uses scanline (sweeping) algorithm.
  */
115
  struct grub_mmap_iterate_ctx ctx;
116
  int i, done;
117 118 119 120 121 122 123 124

  struct grub_mmap_scan t;

  /* Previous scanline event. */
  grub_uint64_t lastaddr;
  int lasttype;
  /* Current scanline event. */
  int curtype;
125 126 127
  /* How many regions of given type/priority overlap at current location? */
  /* Normally there shouldn't be more than one region per priority but be robust.  */
  struct mm_list *present;
128 129 130
  /* Number of mmap chunks. */
  int mmap_num;

131
#ifndef GRUB_MMAP_REGISTER_BY_FIRMWARE
132 133
  struct grub_mmap_region *cur;
#endif
134

135 136
  mmap_num = 0;

137
#ifndef GRUB_MMAP_REGISTER_BY_FIRMWARE
138 139 140 141
  for (cur = grub_mmap_overlays; cur; cur = cur->next)
    mmap_num++;
#endif

142
  grub_machine_mmap_iterate (count_hook, &mmap_num);
143

144
  /* Initialize variables. */
145
  ctx.scanline_events = (struct grub_mmap_scan *)
146
    grub_malloc (sizeof (struct grub_mmap_scan) * 2 * mmap_num);
147

148 149 150 151 152 153 154 155
  present = grub_zalloc (sizeof (present[0]) * current_priority);

  if (! ctx.scanline_events || !present)
    {
      grub_free (ctx.scanline_events);
      grub_free (present);
      return grub_errno;
    }
156

157
  ctx.i = 0;
158
#ifndef GRUB_MMAP_REGISTER_BY_FIRMWARE
159 160 161
  /* Register scanline events. */
  for (cur = grub_mmap_overlays; cur; cur = cur->next)
    {
162 163
      ctx.scanline_events[ctx.i].pos = cur->start;
      ctx.scanline_events[ctx.i].type = 0;
164 165
      ctx.scanline_events[ctx.i].memtype = cur->type;
      ctx.scanline_events[ctx.i].priority = cur->priority;
166 167 168 169
      ctx.i++;

      ctx.scanline_events[ctx.i].pos = cur->end;
      ctx.scanline_events[ctx.i].type = 1;
170 171
      ctx.scanline_events[ctx.i].memtype = cur->type;
      ctx.scanline_events[ctx.i].priority = cur->priority;
172
      ctx.i++;
173 174 175
    }
#endif /* ! GRUB_MMAP_REGISTER_BY_FIRMWARE */

176
  grub_machine_mmap_iterate (fill_hook, &ctx);
177

178 179
  /* Primitive bubble sort. It has complexity O(n^2) but since we're
     unlikely to have more than 100 chunks it's probably one of the
180 181 182 183 184 185
     fastest for one purpose. */
  done = 1;
  while (done)
    {
      done = 0;
      for (i = 0; i < 2 * mmap_num - 1; i++)
186 187 188 189
	if (ctx.scanline_events[i + 1].pos < ctx.scanline_events[i].pos
	    || (ctx.scanline_events[i + 1].pos == ctx.scanline_events[i].pos
		&& ctx.scanline_events[i + 1].type == 0
		&& ctx.scanline_events[i].type == 1))
190
	  {
191 192 193
	    t = ctx.scanline_events[i + 1];
	    ctx.scanline_events[i + 1] = ctx.scanline_events[i];
	    ctx.scanline_events[i] = t;
194 195 196 197
	    done = 1;
	  }
    }

198 199
  lastaddr = ctx.scanline_events[0].pos;
  lasttype = ctx.scanline_events[0].memtype;
200 201 202
  for (i = 0; i < 2 * mmap_num; i++)
    {
      /* Process event. */
203
      if (ctx.scanline_events[i].type)
204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233
	{
	  if (present[ctx.scanline_events[i].priority].present)
	    {
	      if (present[ctx.scanline_events[i].priority].val == ctx.scanline_events[i].memtype)
		{
		  if (present[ctx.scanline_events[i].priority].next)
		    {
		      struct mm_list *p = present[ctx.scanline_events[i].priority].next;
		      present[ctx.scanline_events[i].priority] = *p;
		      grub_free (p);
		    }
		  else
		    {
		      present[ctx.scanline_events[i].priority].present = 0;
		    }
		}
	      else
		{
		  struct mm_list **q = &(present[ctx.scanline_events[i].priority].next), *p;
		  for (; *q; q = &((*q)->next))
		    if ((*q)->val == ctx.scanline_events[i].memtype)
		      {
			p = *q;
			*q = p->next;
			grub_free (p);
			break;
		      }
		}
	    }
	}
234
      else
235 236 237 238 239 240 241 242 243 244 245 246 247 248 249
	{
	  if (!present[ctx.scanline_events[i].priority].present)
	    {
	      present[ctx.scanline_events[i].priority].present = 1;
	      present[ctx.scanline_events[i].priority].val = ctx.scanline_events[i].memtype;
	    }
	  else
	    {
	      struct mm_list *n = grub_malloc (sizeof (*n));
	      n->val = ctx.scanline_events[i].memtype;
	      n->present = 1;
	      n->next = present[ctx.scanline_events[i].priority].next;
	      present[ctx.scanline_events[i].priority].next = n;
	    }
	}
250 251 252

      /* Determine current region type. */
      curtype = -1;
253 254 255 256 257 258 259 260 261
      {
	int k;
	for (k = current_priority - 1; k >= 0; k--)
	  if (present[k].present)
	    {
	      curtype = present[k].val;
	      break;
	    }
      }
262

263
      /* Announce region to the hook if necessary. */
264
      if ((curtype == -1 || curtype != lasttype)
265
	  && lastaddr != ctx.scanline_events[i].pos
266
	  && lasttype != -1
267
	  && lasttype != GRUB_MEMORY_HOLE
268 269
	  && hook (lastaddr, ctx.scanline_events[i].pos - lastaddr, lasttype,
		   hook_data))
270
	{
271
	  grub_free (ctx.scanline_events);
272 273 274 275
	  return GRUB_ERR_NONE;
	}

      /* Update last values if necessary. */
276
      if (curtype == -1 || curtype != lasttype)
277 278
	{
	  lasttype = curtype;
279
	  lastaddr = ctx.scanline_events[i].pos;
280 281 282
	}
    }

283
  grub_free (ctx.scanline_events);
284 285 286
  return GRUB_ERR_NONE;
}

287
#ifndef GRUB_MMAP_REGISTER_BY_FIRMWARE
288 289 290 291 292 293 294
int
grub_mmap_register (grub_uint64_t start, grub_uint64_t size, int type)
{
  struct grub_mmap_region *cur;

  grub_dprintf ("mmap", "registering\n");

295
  cur = (struct grub_mmap_region *)
296 297
    grub_malloc (sizeof (struct grub_mmap_region));
  if (! cur)
298
    return 0;
299 300 301 302 303 304

  cur->next = grub_mmap_overlays;
  cur->start = start;
  cur->end = start + size;
  cur->type = type;
  cur->handle = curhandle++;
305
  cur->priority = current_priority++;
306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322
  grub_mmap_overlays = cur;

  if (grub_machine_mmap_register (start, size, type, curhandle))
    {
      grub_mmap_overlays = cur->next;
      grub_free (cur);
      return 0;
    }

  return cur->handle;
}

grub_err_t
grub_mmap_unregister (int handle)
{
  struct grub_mmap_region *cur, *prev;

323
  for (cur = grub_mmap_overlays, prev = 0; cur; prev = cur, cur = cur->next)
324 325 326
    if (handle == cur->handle)
      {
	grub_err_t err;
327 328
	err = grub_machine_mmap_unregister (handle);
	if (err)
329 330 331 332 333 334 335 336 337
	  return err;

	if (prev)
	  prev->next = cur->next;
	else
	  grub_mmap_overlays = cur->next;
	grub_free (cur);
	return GRUB_ERR_NONE;
      }
338
  return grub_error (GRUB_ERR_BUG, "mmap overlay not found");
339 340 341 342 343 344
}

#endif /* ! GRUB_MMAP_REGISTER_BY_FIRMWARE */

#define CHUNK_SIZE	0x400

345 346 347 348
struct badram_entry {
  grub_uint64_t addr, mask;
};

349
static inline grub_uint64_t
350
fill_mask (struct badram_entry *entry, grub_uint64_t iterator)
351 352
{
  int i, j;
353
  grub_uint64_t ret = (entry->addr & entry->mask);
354 355 356

  /* Find first fixed bit. */
  for (i = 0; i < 64; i++)
357
    if ((entry->mask & (1ULL << i)) != 0)
358 359 360
      break;
  j = 0;
  for (; i < 64; i++)
361
    if ((entry->mask & (1ULL << i)) == 0)
362 363 364 365 366 367 368 369
      {
	if ((iterator & (1ULL << j)) != 0)
	  ret |= 1ULL << i;
	j++;
      }
  return ret;
}

370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421
/* Helper for grub_cmd_badram.  */
static int
badram_iter (grub_uint64_t addr, grub_uint64_t size,
	     grub_memory_type_t type __attribute__ ((unused)), void *data)
{
  struct badram_entry *entry = data;
  grub_uint64_t iterator, low, high, cur;
  int tail, var;
  int i;
  grub_dprintf ("badram", "hook %llx+%llx\n", (unsigned long long) addr,
		(unsigned long long) size);

  /* How many trailing zeros? */
  for (tail = 0; ! (entry->mask & (1ULL << tail)); tail++);

  /* How many zeros in mask? */
  var = 0;
  for (i = 0; i < 64; i++)
    if (! (entry->mask & (1ULL << i)))
      var++;

  if (fill_mask (entry, 0) >= addr)
    iterator = 0;
  else
    {
      low = 0;
      high = ~0ULL;
      /* Find starting value. Keep low and high such that
	 fill_mask (low) < addr and fill_mask (high) >= addr;
      */
      while (high - low > 1)
	{
	  cur = (low + high) / 2;
	  if (fill_mask (entry, cur) >= addr)
	    high = cur;
	  else
	    low = cur;
	}
      iterator = high;
    }

  for (; iterator < (1ULL << (var - tail))
	 && (cur = fill_mask (entry, iterator)) < addr + size;
       iterator++)
    {
      grub_dprintf ("badram", "%llx (size %llx) is a badram range\n",
		    (unsigned long long) cur, (1ULL << tail));
      grub_mmap_register (cur, (1ULL << tail), GRUB_MEMORY_HOLE);
    }
  return 0;
}

422 423 424 425 426
static grub_err_t
grub_cmd_badram (grub_command_t cmd __attribute__ ((unused)),
		 int argc, char **args)
{
  char * str;
427
  struct badram_entry entry;
428 429

  if (argc != 1)
430
    return grub_error (GRUB_ERR_BAD_ARGUMENT, N_("one argument expected"));
431 432 433 434 435 436 437 438

  grub_dprintf ("badram", "executing badram\n");

  str = args[0];

  while (1)
    {
      /* Parse address and mask.  */
439
      entry.addr = grub_strtoull (str, &str, 16);
440 441
      if (*str == ',')
	str++;
442
      entry.mask = grub_strtoull (str, &str, 16);
443 444 445 446 447 448 449 450 451 452 453
      if (*str == ',')
	str++;

      if (grub_errno == GRUB_ERR_BAD_NUMBER)
	{
	  grub_errno = 0;
	  return GRUB_ERR_NONE;
	}

      /* When part of a page is tainted, we discard the whole of it.  There's
	 no point in providing sub-page chunks.  */
454
      entry.mask &= ~(CHUNK_SIZE - 1);
455

456
      grub_dprintf ("badram", "badram %llx:%llx\n",
457 458
		    (unsigned long long) entry.addr,
		    (unsigned long long) entry.mask);
459

460
      grub_mmap_iterate (badram_iter, &entry);
461 462 463
    }
}

464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485
static grub_uint64_t
parsemem (const char *str)
{
  grub_uint64_t ret;
  char *ptr;

  ret = grub_strtoul (str, &ptr, 0);

  switch (*ptr)
    {
    case 'K':
      return ret << 10;
    case 'M':
      return ret << 20;
    case 'G':
      return ret << 30;
    case 'T':
      return ret << 40;
    }
  return ret;
}

486
struct cutmem_range {
487
  grub_uint64_t from, to;
488
};
489

490 491 492 493 494 495 496
/* Helper for grub_cmd_cutmem.  */
static int
cutmem_iter (grub_uint64_t addr, grub_uint64_t size,
	     grub_memory_type_t type __attribute__ ((unused)), void *data)
{
  struct cutmem_range *range = data;
  grub_uint64_t end = addr + size;
497

498 499 500 501
  if (addr <= range->from)
    addr = range->from;
  if (end >= range->to)
    end = range->to;
502

503
  if (end <= addr)
504
    return 0;
505 506 507 508 509 510 511 512 513 514

  grub_mmap_register (addr, end - addr, GRUB_MEMORY_HOLE);
  return 0;
}

static grub_err_t
grub_cmd_cutmem (grub_command_t cmd __attribute__ ((unused)),
		 int argc, char **args)
{
  struct cutmem_range range;
515

516
  if (argc != 2)
517
    return grub_error (GRUB_ERR_BAD_ARGUMENT, N_("two arguments expected"));
518

519
  range.from = parsemem (args[0]);
520 521
  if (grub_errno)
    return grub_errno;
522

523
  range.to = parsemem (args[1]);
524 525 526
  if (grub_errno)
    return grub_errno;

527
  grub_mmap_iterate (cutmem_iter, &range);
528 529 530 531 532

  return GRUB_ERR_NONE;
}

static grub_command_t cmd, cmd_cut;
533 534 535 536 537


GRUB_MOD_INIT(mmap)
{
  cmd = grub_register_command ("badram", grub_cmd_badram,
538
			       N_("ADDR1,MASK1[,ADDR2,MASK2[,...]]"),
539
			       N_("Declare memory regions as faulty (badram)."));
540
  cmd_cut = grub_register_command ("cutmem", grub_cmd_cutmem,
541 542
				   N_("FROM[K|M|G] TO[K|M|G]"),
				   N_("Remove any memory regions in specified range."));
543

544 545 546 547 548
}

GRUB_MOD_FINI(mmap)
{
  grub_unregister_command (cmd);
549
  grub_unregister_command (cmd_cut);
550 551
}