intel_gas.c revision 280424
1/*- 2 * Copyright (c) 2013 The FreeBSD Foundation 3 * All rights reserved. 4 * 5 * This software was developed by Konstantin Belousov <kib@FreeBSD.org> 6 * under sponsorship from the FreeBSD Foundation. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 */ 29 30#include <sys/cdefs.h> 31__FBSDID("$FreeBSD: stable/10/sys/x86/iommu/intel_gas.c 280424 2015-03-24 08:18:24Z kib $"); 32 33#define RB_AUGMENT(entry) dmar_gas_augment_entry(entry) 34 35#include <sys/param.h> 36#include <sys/systm.h> 37#include <sys/malloc.h> 38#include <sys/bus.h> 39#include <sys/interrupt.h> 40#include <sys/kernel.h> 41#include <sys/ktr.h> 42#include <sys/lock.h> 43#include <sys/proc.h> 44#include <sys/rwlock.h> 45#include <sys/memdesc.h> 46#include <sys/mutex.h> 47#include <sys/sysctl.h> 48#include <sys/rman.h> 49#include <sys/taskqueue.h> 50#include <sys/tree.h> 51#include <sys/uio.h> 52#include <dev/pci/pcivar.h> 53#include <vm/vm.h> 54#include <vm/vm_extern.h> 55#include <vm/vm_kern.h> 56#include <vm/vm_object.h> 57#include <vm/vm_page.h> 58#include <vm/vm_map.h> 59#include <vm/uma.h> 60#include <machine/atomic.h> 61#include <machine/bus.h> 62#include <machine/md_var.h> 63#include <machine/specialreg.h> 64#include <x86/include/busdma_impl.h> 65#include <x86/iommu/intel_reg.h> 66#include <x86/iommu/busdma_dmar.h> 67#include <x86/iommu/intel_dmar.h> 68 69/* 70 * Guest Address Space management. 71 */ 72 73static uma_zone_t dmar_map_entry_zone; 74 75static void 76intel_gas_init(void) 77{ 78 79 dmar_map_entry_zone = uma_zcreate("DMAR_MAP_ENTRY", 80 sizeof(struct dmar_map_entry), NULL, NULL, 81 NULL, NULL, UMA_ALIGN_PTR, 0); 82} 83SYSINIT(intel_gas, SI_SUB_DRIVERS, SI_ORDER_FIRST, intel_gas_init, NULL); 84 85struct dmar_map_entry * 86dmar_gas_alloc_entry(struct dmar_ctx *ctx, u_int flags) 87{ 88 struct dmar_map_entry *res; 89 90 KASSERT((flags & ~(DMAR_PGF_WAITOK)) == 0, 91 ("unsupported flags %x", flags)); 92 93 res = uma_zalloc(dmar_map_entry_zone, ((flags & DMAR_PGF_WAITOK) != 94 0 ? M_WAITOK : M_NOWAIT) | M_ZERO); 95 if (res != NULL) { 96 res->ctx = ctx; 97 atomic_add_int(&ctx->entries_cnt, 1); 98 } 99 return (res); 100} 101 102void 103dmar_gas_free_entry(struct dmar_ctx *ctx, struct dmar_map_entry *entry) 104{ 105 106 KASSERT(ctx == entry->ctx, 107 ("mismatched free ctx %p entry %p entry->ctx %p", ctx, 108 entry, entry->ctx)); 109 atomic_subtract_int(&ctx->entries_cnt, 1); 110 uma_zfree(dmar_map_entry_zone, entry); 111} 112 113static int 114dmar_gas_cmp_entries(struct dmar_map_entry *a, struct dmar_map_entry *b) 115{ 116 117 /* Last entry have zero size, so <= */ 118 KASSERT(a->start <= a->end, ("inverted entry %p (%jx, %jx)", 119 a, (uintmax_t)a->start, (uintmax_t)a->end)); 120 KASSERT(b->start <= b->end, ("inverted entry %p (%jx, %jx)", 121 b, (uintmax_t)b->start, (uintmax_t)b->end)); 122 KASSERT(a->end <= b->start || b->end <= a->start || 123 a->end == a->start || b->end == b->start, 124 ("overlapping entries %p (%jx, %jx) %p (%jx, %jx)", 125 a, (uintmax_t)a->start, (uintmax_t)a->end, 126 b, (uintmax_t)b->start, (uintmax_t)b->end)); 127 128 if (a->end < b->end) 129 return (-1); 130 else if (b->end < a->end) 131 return (1); 132 return (0); 133} 134 135static void 136dmar_gas_augment_entry(struct dmar_map_entry *entry) 137{ 138 struct dmar_map_entry *l, *r; 139 140 for (; entry != NULL; entry = RB_PARENT(entry, rb_entry)) { 141 l = RB_LEFT(entry, rb_entry); 142 r = RB_RIGHT(entry, rb_entry); 143 if (l == NULL && r == NULL) { 144 entry->free_down = entry->free_after; 145 } else if (l == NULL && r != NULL) { 146 entry->free_down = MAX(entry->free_after, r->free_down); 147 } else if (/*l != NULL && */ r == NULL) { 148 entry->free_down = MAX(entry->free_after, l->free_down); 149 } else /* if (l != NULL && r != NULL) */ { 150 entry->free_down = MAX(entry->free_after, l->free_down); 151 entry->free_down = MAX(entry->free_down, r->free_down); 152 } 153 } 154} 155 156RB_GENERATE(dmar_gas_entries_tree, dmar_map_entry, rb_entry, 157 dmar_gas_cmp_entries); 158 159static void 160dmar_gas_fix_free(struct dmar_ctx *ctx, struct dmar_map_entry *entry) 161{ 162 struct dmar_map_entry *next; 163 164 next = RB_NEXT(dmar_gas_entries_tree, &ctx->rb_root, entry); 165 entry->free_after = (next != NULL ? next->start : ctx->end) - 166 entry->end; 167 dmar_gas_augment_entry(entry); 168} 169 170#ifdef INVARIANTS 171static void 172dmar_gas_check_free(struct dmar_ctx *ctx) 173{ 174 struct dmar_map_entry *entry, *next, *l, *r; 175 dmar_gaddr_t v; 176 177 RB_FOREACH(entry, dmar_gas_entries_tree, &ctx->rb_root) { 178 KASSERT(ctx == entry->ctx, 179 ("mismatched free ctx %p entry %p entry->ctx %p", ctx, 180 entry, entry->ctx)); 181 next = RB_NEXT(dmar_gas_entries_tree, &ctx->rb_root, entry); 182 if (next == NULL) { 183 MPASS(entry->free_after == ctx->end - entry->end); 184 } else { 185 MPASS(entry->free_after = next->start - entry->end); 186 MPASS(entry->end <= next->start); 187 } 188 l = RB_LEFT(entry, rb_entry); 189 r = RB_RIGHT(entry, rb_entry); 190 if (l == NULL && r == NULL) { 191 MPASS(entry->free_down == entry->free_after); 192 } else if (l == NULL && r != NULL) { 193 MPASS(entry->free_down = MAX(entry->free_after, 194 r->free_down)); 195 } else if (r == NULL) { 196 MPASS(entry->free_down = MAX(entry->free_after, 197 l->free_down)); 198 } else { 199 v = MAX(entry->free_after, l->free_down); 200 v = MAX(entry->free_down, r->free_down); 201 MPASS(entry->free_down == v); 202 } 203 } 204} 205#endif 206 207static bool 208dmar_gas_rb_insert(struct dmar_ctx *ctx, struct dmar_map_entry *entry) 209{ 210 struct dmar_map_entry *prev, *found; 211 212 found = RB_INSERT(dmar_gas_entries_tree, &ctx->rb_root, entry); 213 dmar_gas_fix_free(ctx, entry); 214 prev = RB_PREV(dmar_gas_entries_tree, &ctx->rb_root, entry); 215 if (prev != NULL) 216 dmar_gas_fix_free(ctx, prev); 217 return (found == NULL); 218} 219 220static void 221dmar_gas_rb_remove(struct dmar_ctx *ctx, struct dmar_map_entry *entry) 222{ 223 struct dmar_map_entry *prev; 224 225 prev = RB_PREV(dmar_gas_entries_tree, &ctx->rb_root, entry); 226 RB_REMOVE(dmar_gas_entries_tree, &ctx->rb_root, entry); 227 if (prev != NULL) 228 dmar_gas_fix_free(ctx, prev); 229} 230 231void 232dmar_gas_init_ctx(struct dmar_ctx *ctx) 233{ 234 struct dmar_map_entry *begin, *end; 235 236 begin = dmar_gas_alloc_entry(ctx, DMAR_PGF_WAITOK); 237 end = dmar_gas_alloc_entry(ctx, DMAR_PGF_WAITOK); 238 239 DMAR_CTX_LOCK(ctx); 240 KASSERT(ctx->entries_cnt == 2, ("dirty ctx %p", ctx)); 241 KASSERT(RB_EMPTY(&ctx->rb_root), ("non-empty entries %p", ctx)); 242 243 begin->start = 0; 244 begin->end = DMAR_PAGE_SIZE; 245 begin->free_after = ctx->end - begin->end; 246 begin->flags = DMAR_MAP_ENTRY_PLACE | DMAR_MAP_ENTRY_UNMAPPED; 247 dmar_gas_rb_insert(ctx, begin); 248 249 end->start = ctx->end; 250 end->end = ctx->end; 251 end->free_after = 0; 252 end->flags = DMAR_MAP_ENTRY_PLACE | DMAR_MAP_ENTRY_UNMAPPED; 253 dmar_gas_rb_insert(ctx, end); 254 255 ctx->first_place = begin; 256 ctx->last_place = end; 257 DMAR_CTX_UNLOCK(ctx); 258} 259 260void 261dmar_gas_fini_ctx(struct dmar_ctx *ctx) 262{ 263 struct dmar_map_entry *entry, *entry1; 264 265 DMAR_CTX_ASSERT_LOCKED(ctx); 266 KASSERT(ctx->entries_cnt == 2, ("ctx still in use %p", ctx)); 267 268 entry = RB_MIN(dmar_gas_entries_tree, &ctx->rb_root); 269 KASSERT(entry->start == 0, ("start entry start %p", ctx)); 270 KASSERT(entry->end == DMAR_PAGE_SIZE, ("start entry end %p", ctx)); 271 KASSERT(entry->flags == DMAR_MAP_ENTRY_PLACE, 272 ("start entry flags %p", ctx)); 273 RB_REMOVE(dmar_gas_entries_tree, &ctx->rb_root, entry); 274 dmar_gas_free_entry(ctx, entry); 275 276 entry = RB_MAX(dmar_gas_entries_tree, &ctx->rb_root); 277 KASSERT(entry->start == ctx->end, ("end entry start %p", ctx)); 278 KASSERT(entry->end == ctx->end, ("end entry end %p", ctx)); 279 KASSERT(entry->free_after == 0, ("end entry free_after%p", ctx)); 280 KASSERT(entry->flags == DMAR_MAP_ENTRY_PLACE, 281 ("end entry flags %p", ctx)); 282 RB_REMOVE(dmar_gas_entries_tree, &ctx->rb_root, entry); 283 dmar_gas_free_entry(ctx, entry); 284 285 RB_FOREACH_SAFE(entry, dmar_gas_entries_tree, &ctx->rb_root, entry1) { 286 KASSERT((entry->flags & DMAR_MAP_ENTRY_RMRR) != 0, 287 ("non-RMRR entry left %p", ctx)); 288 RB_REMOVE(dmar_gas_entries_tree, &ctx->rb_root, entry); 289 dmar_gas_free_entry(ctx, entry); 290 } 291} 292 293struct dmar_gas_match_args { 294 struct dmar_ctx *ctx; 295 dmar_gaddr_t size; 296 const struct bus_dma_tag_common *common; 297 u_int gas_flags; 298 struct dmar_map_entry *entry; 299}; 300 301static bool 302dmar_gas_match_one(struct dmar_gas_match_args *a, struct dmar_map_entry *prev, 303 dmar_gaddr_t end) 304{ 305 dmar_gaddr_t bs, start; 306 307 if (a->entry->start + a->size > end) 308 return (false); 309 310 /* DMAR_PAGE_SIZE to create gap after new entry. */ 311 if (a->entry->start < prev->end + DMAR_PAGE_SIZE || 312 a->entry->start + a->size + DMAR_PAGE_SIZE > prev->end + 313 prev->free_after) 314 return (false); 315 316 /* No boundary crossing. */ 317 if (dmar_test_boundary(a->entry->start, a->size, a->common->boundary)) 318 return (true); 319 320 /* 321 * The start to start + size region crosses the boundary. 322 * Check if there is enough space after the next boundary 323 * after the prev->end. 324 */ 325 bs = (a->entry->start + a->common->boundary) & ~(a->common->boundary 326 - 1); 327 start = roundup2(bs, a->common->alignment); 328 /* DMAR_PAGE_SIZE to create gap after new entry. */ 329 if (start + a->size + DMAR_PAGE_SIZE <= prev->end + prev->free_after && 330 start + a->size <= end) { 331 a->entry->start = start; 332 return (true); 333 } 334 335 /* 336 * Not enough space to align at boundary, but allowed to split. 337 * We already checked that start + size does not overlap end. 338 * 339 * XXXKIB. It is possible that bs is exactly at the start of 340 * the next entry, then we do not have gap. Ignore for now. 341 */ 342 if ((a->gas_flags & DMAR_GM_CANSPLIT) != 0) { 343 a->size = bs - a->entry->start; 344 return (true); 345 } 346 347 return (false); 348} 349 350static void 351dmar_gas_match_insert(struct dmar_gas_match_args *a, 352 struct dmar_map_entry *prev) 353{ 354 struct dmar_map_entry *next; 355 bool found; 356 357 /* 358 * The prev->end is always aligned on the page size, which 359 * causes page alignment for the entry->start too. The size 360 * is checked to be multiple of the page size. 361 * 362 * The page sized gap is created between consequent 363 * allocations to ensure that out-of-bounds accesses fault. 364 */ 365 a->entry->end = a->entry->start + a->size; 366 367 next = RB_NEXT(dmar_gas_entries_tree, &a->ctx->rb_root, prev); 368 KASSERT(next->start >= a->entry->end && 369 next->start - a->entry->start >= a->size && 370 prev->end <= a->entry->end, 371 ("dmar_gas_match_insert hole failed %p prev (%jx, %jx) " 372 "free_after %jx next (%jx, %jx) entry (%jx, %jx)", a->ctx, 373 (uintmax_t)prev->start, (uintmax_t)prev->end, 374 (uintmax_t)prev->free_after, 375 (uintmax_t)next->start, (uintmax_t)next->end, 376 (uintmax_t)a->entry->start, (uintmax_t)a->entry->end)); 377 378 prev->free_after = a->entry->start - prev->end; 379 a->entry->free_after = next->start - a->entry->end; 380 381 found = dmar_gas_rb_insert(a->ctx, a->entry); 382 KASSERT(found, ("found dup %p start %jx size %jx", 383 a->ctx, (uintmax_t)a->entry->start, (uintmax_t)a->size)); 384 a->entry->flags = DMAR_MAP_ENTRY_MAP; 385 386 KASSERT(RB_PREV(dmar_gas_entries_tree, &a->ctx->rb_root, 387 a->entry) == prev, 388 ("entry %p prev %p inserted prev %p", a->entry, prev, 389 RB_PREV(dmar_gas_entries_tree, &a->ctx->rb_root, a->entry))); 390 KASSERT(RB_NEXT(dmar_gas_entries_tree, &a->ctx->rb_root, 391 a->entry) == next, 392 ("entry %p next %p inserted next %p", a->entry, next, 393 RB_NEXT(dmar_gas_entries_tree, &a->ctx->rb_root, a->entry))); 394} 395 396static int 397dmar_gas_lowermatch(struct dmar_gas_match_args *a, struct dmar_map_entry *prev) 398{ 399 struct dmar_map_entry *l; 400 int ret; 401 402 if (prev->end < a->common->lowaddr) { 403 a->entry->start = roundup2(prev->end + DMAR_PAGE_SIZE, 404 a->common->alignment); 405 if (dmar_gas_match_one(a, prev, a->common->lowaddr)) { 406 dmar_gas_match_insert(a, prev); 407 return (0); 408 } 409 } 410 if (prev->free_down < a->size + DMAR_PAGE_SIZE) 411 return (ENOMEM); 412 l = RB_LEFT(prev, rb_entry); 413 if (l != NULL) { 414 ret = dmar_gas_lowermatch(a, l); 415 if (ret == 0) 416 return (0); 417 } 418 l = RB_RIGHT(prev, rb_entry); 419 if (l != NULL) 420 return (dmar_gas_lowermatch(a, l)); 421 return (ENOMEM); 422} 423 424static int 425dmar_gas_uppermatch(struct dmar_gas_match_args *a) 426{ 427 struct dmar_map_entry *next, *prev, find_entry; 428 429 find_entry.start = a->common->highaddr; 430 next = RB_NFIND(dmar_gas_entries_tree, &a->ctx->rb_root, &find_entry); 431 if (next == NULL) 432 return (ENOMEM); 433 prev = RB_PREV(dmar_gas_entries_tree, &a->ctx->rb_root, next); 434 KASSERT(prev != NULL, ("no prev %p %jx", a->ctx, 435 (uintmax_t)find_entry.start)); 436 for (;;) { 437 a->entry->start = prev->start + DMAR_PAGE_SIZE; 438 if (a->entry->start < a->common->highaddr) 439 a->entry->start = a->common->highaddr; 440 a->entry->start = roundup2(a->entry->start, 441 a->common->alignment); 442 if (dmar_gas_match_one(a, prev, a->ctx->end)) { 443 dmar_gas_match_insert(a, prev); 444 return (0); 445 } 446 447 /* 448 * XXXKIB. This falls back to linear iteration over 449 * the free space in the high region. But high 450 * regions are almost unused, the code should be 451 * enough to cover the case, although in the 452 * non-optimal way. 453 */ 454 prev = next; 455 next = RB_NEXT(dmar_gas_entries_tree, &a->ctx->rb_root, prev); 456 KASSERT(next != NULL, ("no next %p %jx", a->ctx, 457 (uintmax_t)find_entry.start)); 458 if (next->end >= a->ctx->end) 459 return (ENOMEM); 460 } 461} 462 463static int 464dmar_gas_find_space(struct dmar_ctx *ctx, 465 const struct bus_dma_tag_common *common, dmar_gaddr_t size, 466 u_int flags, struct dmar_map_entry *entry) 467{ 468 struct dmar_gas_match_args a; 469 int error; 470 471 DMAR_CTX_ASSERT_LOCKED(ctx); 472 KASSERT(entry->flags == 0, ("dirty entry %p %p", ctx, entry)); 473 KASSERT((size & DMAR_PAGE_MASK) == 0, ("size %jx", (uintmax_t)size)); 474 475 a.ctx = ctx; 476 a.size = size; 477 a.common = common; 478 a.gas_flags = flags; 479 a.entry = entry; 480 481 /* Handle lower region. */ 482 if (common->lowaddr > 0) { 483 error = dmar_gas_lowermatch(&a, RB_ROOT(&ctx->rb_root)); 484 if (error == 0) 485 return (0); 486 KASSERT(error == ENOMEM, 487 ("error %d from dmar_gas_lowermatch", error)); 488 } 489 /* Handle upper region. */ 490 if (common->highaddr >= ctx->end) 491 return (ENOMEM); 492 error = dmar_gas_uppermatch(&a); 493 KASSERT(error == ENOMEM, 494 ("error %d from dmar_gas_uppermatch", error)); 495 return (error); 496} 497 498static int 499dmar_gas_alloc_region(struct dmar_ctx *ctx, struct dmar_map_entry *entry, 500 u_int flags) 501{ 502 struct dmar_map_entry *next, *prev; 503 bool found; 504 505 DMAR_CTX_ASSERT_LOCKED(ctx); 506 507 if ((entry->start & DMAR_PAGE_MASK) != 0 || 508 (entry->end & DMAR_PAGE_MASK) != 0) 509 return (EINVAL); 510 if (entry->start >= entry->end) 511 return (EINVAL); 512 if (entry->end >= ctx->end) 513 return (EINVAL); 514 515 next = RB_NFIND(dmar_gas_entries_tree, &ctx->rb_root, entry); 516 KASSERT(next != NULL, ("next must be non-null %p %jx", ctx, 517 (uintmax_t)entry->start)); 518 prev = RB_PREV(dmar_gas_entries_tree, &ctx->rb_root, next); 519 /* prev could be NULL */ 520 521 /* 522 * Adapt to broken BIOSes which specify overlapping RMRR 523 * entries. 524 * 525 * XXXKIB: this does not handle a case when prev or next 526 * entries are completely covered by the current one, which 527 * extends both ways. 528 */ 529 if (prev != NULL && prev->end > entry->start && 530 (prev->flags & DMAR_MAP_ENTRY_PLACE) == 0) { 531 if ((prev->flags & DMAR_MAP_ENTRY_RMRR) == 0) 532 return (EBUSY); 533 entry->start = prev->end; 534 } 535 if (next != NULL && next->start < entry->end && 536 (next->flags & DMAR_MAP_ENTRY_PLACE) == 0) { 537 if ((next->flags & DMAR_MAP_ENTRY_RMRR) == 0) 538 return (EBUSY); 539 entry->end = next->start; 540 } 541 if (entry->end == entry->start) 542 return (0); 543 544 if (prev != NULL && prev->end > entry->start) { 545 /* This assumes that prev is the placeholder entry. */ 546 dmar_gas_rb_remove(ctx, prev); 547 prev = NULL; 548 } 549 if (next != NULL && next->start < entry->end) { 550 dmar_gas_rb_remove(ctx, next); 551 next = NULL; 552 } 553 554 found = dmar_gas_rb_insert(ctx, entry); 555 KASSERT(found, ("found RMRR dup %p start %jx end %jx", 556 ctx, (uintmax_t)entry->start, (uintmax_t)entry->end)); 557 entry->flags = DMAR_MAP_ENTRY_RMRR; 558 559#ifdef INVARIANTS 560 struct dmar_map_entry *ip, *in; 561 ip = RB_PREV(dmar_gas_entries_tree, &ctx->rb_root, entry); 562 in = RB_NEXT(dmar_gas_entries_tree, &ctx->rb_root, entry); 563 KASSERT(prev == NULL || ip == prev, 564 ("RMRR %p (%jx %jx) prev %p (%jx %jx) ins prev %p (%jx %jx)", 565 entry, entry->start, entry->end, prev, 566 prev == NULL ? 0 : prev->start, prev == NULL ? 0 : prev->end, 567 ip, ip == NULL ? 0 : ip->start, ip == NULL ? 0 : ip->end)); 568 KASSERT(next == NULL || in == next, 569 ("RMRR %p (%jx %jx) next %p (%jx %jx) ins next %p (%jx %jx)", 570 entry, entry->start, entry->end, next, 571 next == NULL ? 0 : next->start, next == NULL ? 0 : next->end, 572 in, in == NULL ? 0 : in->start, in == NULL ? 0 : in->end)); 573#endif 574 575 return (0); 576} 577 578void 579dmar_gas_free_space(struct dmar_ctx *ctx, struct dmar_map_entry *entry) 580{ 581 582 DMAR_CTX_ASSERT_LOCKED(ctx); 583 KASSERT((entry->flags & (DMAR_MAP_ENTRY_PLACE | DMAR_MAP_ENTRY_RMRR | 584 DMAR_MAP_ENTRY_MAP)) == DMAR_MAP_ENTRY_MAP, 585 ("permanent entry %p %p", ctx, entry)); 586 587 dmar_gas_rb_remove(ctx, entry); 588 entry->flags &= ~DMAR_MAP_ENTRY_MAP; 589#ifdef INVARIANTS 590 if (dmar_check_free) 591 dmar_gas_check_free(ctx); 592#endif 593} 594 595void 596dmar_gas_free_region(struct dmar_ctx *ctx, struct dmar_map_entry *entry) 597{ 598 struct dmar_map_entry *next, *prev; 599 600 DMAR_CTX_ASSERT_LOCKED(ctx); 601 KASSERT((entry->flags & (DMAR_MAP_ENTRY_PLACE | DMAR_MAP_ENTRY_RMRR | 602 DMAR_MAP_ENTRY_MAP)) == DMAR_MAP_ENTRY_RMRR, 603 ("non-RMRR entry %p %p", ctx, entry)); 604 605 prev = RB_PREV(dmar_gas_entries_tree, &ctx->rb_root, entry); 606 next = RB_NEXT(dmar_gas_entries_tree, &ctx->rb_root, entry); 607 dmar_gas_rb_remove(ctx, entry); 608 entry->flags &= ~DMAR_MAP_ENTRY_RMRR; 609 610 if (prev == NULL) 611 dmar_gas_rb_insert(ctx, ctx->first_place); 612 if (next == NULL) 613 dmar_gas_rb_insert(ctx, ctx->last_place); 614} 615 616int 617dmar_gas_map(struct dmar_ctx *ctx, const struct bus_dma_tag_common *common, 618 dmar_gaddr_t size, u_int eflags, u_int flags, vm_page_t *ma, 619 struct dmar_map_entry **res) 620{ 621 struct dmar_map_entry *entry; 622 int error; 623 624 KASSERT((flags & ~(DMAR_GM_CANWAIT | DMAR_GM_CANSPLIT)) == 0, 625 ("invalid flags 0x%x", flags)); 626 627 entry = dmar_gas_alloc_entry(ctx, (flags & DMAR_GM_CANWAIT) != 0 ? 628 DMAR_PGF_WAITOK : 0); 629 if (entry == NULL) 630 return (ENOMEM); 631 DMAR_CTX_LOCK(ctx); 632 error = dmar_gas_find_space(ctx, common, size, flags, entry); 633 if (error == ENOMEM) { 634 DMAR_CTX_UNLOCK(ctx); 635 dmar_gas_free_entry(ctx, entry); 636 return (error); 637 } 638#ifdef INVARIANTS 639 if (dmar_check_free) 640 dmar_gas_check_free(ctx); 641#endif 642 KASSERT(error == 0, 643 ("unexpected error %d from dmar_gas_find_entry", error)); 644 KASSERT(entry->end < ctx->end, ("allocated GPA %jx, max GPA %jx", 645 (uintmax_t)entry->end, (uintmax_t)ctx->end)); 646 entry->flags |= eflags; 647 DMAR_CTX_UNLOCK(ctx); 648 649 error = ctx_map_buf(ctx, entry->start, size, ma, 650 ((eflags & DMAR_MAP_ENTRY_READ) != 0 ? DMAR_PTE_R : 0) | 651 ((eflags & DMAR_MAP_ENTRY_WRITE) != 0 ? DMAR_PTE_W : 0) | 652 ((eflags & DMAR_MAP_ENTRY_SNOOP) != 0 ? DMAR_PTE_SNP : 0) | 653 ((eflags & DMAR_MAP_ENTRY_TM) != 0 ? DMAR_PTE_TM : 0), 654 (flags & DMAR_GM_CANWAIT) != 0 ? DMAR_PGF_WAITOK : 0); 655 if (error == ENOMEM) { 656 dmar_ctx_unload_entry(entry, true); 657 return (error); 658 } 659 KASSERT(error == 0, 660 ("unexpected error %d from ctx_map_buf", error)); 661 662 *res = entry; 663 return (0); 664} 665 666int 667dmar_gas_map_region(struct dmar_ctx *ctx, struct dmar_map_entry *entry, 668 u_int eflags, u_int flags, vm_page_t *ma) 669{ 670 dmar_gaddr_t start; 671 int error; 672 673 KASSERT(entry->flags == 0, ("used RMRR entry %p %p %x", ctx, 674 entry, entry->flags)); 675 KASSERT((flags & ~(DMAR_GM_CANWAIT)) == 0, 676 ("invalid flags 0x%x", flags)); 677 678 start = entry->start; 679 DMAR_CTX_LOCK(ctx); 680 error = dmar_gas_alloc_region(ctx, entry, flags); 681 if (error != 0) { 682 DMAR_CTX_UNLOCK(ctx); 683 return (error); 684 } 685 entry->flags |= eflags; 686 DMAR_CTX_UNLOCK(ctx); 687 if (entry->end == entry->start) 688 return (0); 689 690 error = ctx_map_buf(ctx, entry->start, entry->end - entry->start, 691 ma + OFF_TO_IDX(start - entry->start), 692 ((eflags & DMAR_MAP_ENTRY_READ) != 0 ? DMAR_PTE_R : 0) | 693 ((eflags & DMAR_MAP_ENTRY_WRITE) != 0 ? DMAR_PTE_W : 0) | 694 ((eflags & DMAR_MAP_ENTRY_SNOOP) != 0 ? DMAR_PTE_SNP : 0) | 695 ((eflags & DMAR_MAP_ENTRY_TM) != 0 ? DMAR_PTE_TM : 0), 696 (flags & DMAR_GM_CANWAIT) != 0 ? DMAR_PGF_WAITOK : 0); 697 if (error == ENOMEM) { 698 dmar_ctx_unload_entry(entry, false); 699 return (error); 700 } 701 KASSERT(error == 0, 702 ("unexpected error %d from ctx_map_buf", error)); 703 704 return (0); 705} 706 707int 708dmar_gas_reserve_region(struct dmar_ctx *ctx, dmar_gaddr_t start, 709 dmar_gaddr_t end) 710{ 711 struct dmar_map_entry *entry; 712 int error; 713 714 entry = dmar_gas_alloc_entry(ctx, DMAR_PGF_WAITOK); 715 entry->start = start; 716 entry->end = end; 717 DMAR_CTX_LOCK(ctx); 718 error = dmar_gas_alloc_region(ctx, entry, DMAR_GM_CANWAIT); 719 if (error == 0) 720 entry->flags |= DMAR_MAP_ENTRY_UNMAPPED; 721 DMAR_CTX_UNLOCK(ctx); 722 if (error != 0) 723 dmar_gas_free_entry(ctx, entry); 724 return (error); 725} 726