Changes in kernel/generic/src/mm/as.c [30718cc2:fc47885] in mainline
- File:
-
- 1 edited
-
kernel/generic/src/mm/as.c (modified) (54 diffs)
Legend:
- Unmodified
- Added
- Removed
-
kernel/generic/src/mm/as.c
r30718cc2 rfc47885 71 71 #include <memstr.h> 72 72 #include <macros.h> 73 #include <bitops.h>74 73 #include <arch.h> 75 74 #include <errno.h> … … 289 288 /** Check area conflicts with other areas. 290 289 * 291 * @param as Address space.292 * @param addrStarting virtual address of the area being tested.293 * @param count Number of pages inthe area being tested.294 * @param avoid Do not touch this area.290 * @param as Address space. 291 * @param va Starting virtual address of the area being tested. 292 * @param size Size of the area being tested. 293 * @param avoid_area Do not touch this area. 295 294 * 296 295 * @return True if there is no conflict, false otherwise. 297 296 * 298 297 */ 299 NO_TRACE static bool check_area_conflicts(as_t *as, uintptr_t addr, 300 size_t count, as_area_t *avoid) 301 { 302 ASSERT((addr % PAGE_SIZE) == 0); 298 NO_TRACE static bool check_area_conflicts(as_t *as, uintptr_t va, size_t size, 299 as_area_t *avoid_area) 300 { 303 301 ASSERT(mutex_locked(&as->lock)); 304 302 … … 306 304 * We don't want any area to have conflicts with NULL page. 307 305 */ 308 if (overlaps( addr, count << PAGE_WIDTH, (uintptr_t) NULL, PAGE_SIZE))306 if (overlaps(va, size, (uintptr_t) NULL, PAGE_SIZE)) 309 307 return false; 310 308 … … 318 316 btree_node_t *leaf; 319 317 as_area_t *area = 320 (as_area_t *) btree_search(&as->as_area_btree, addr, &leaf);318 (as_area_t *) btree_search(&as->as_area_btree, va, &leaf); 321 319 if (area) { 322 if (area != avoid )320 if (area != avoid_area) 323 321 return false; 324 322 } … … 330 328 area = (as_area_t *) node->value[node->keys - 1]; 331 329 332 if (area != avoid) { 333 mutex_lock(&area->lock); 334 335 if (overlaps(addr, count << PAGE_WIDTH, 336 area->base, area->pages << PAGE_WIDTH)) { 337 mutex_unlock(&area->lock); 338 return false; 339 } 340 330 mutex_lock(&area->lock); 331 332 if (overlaps(va, size, area->base, area->pages * PAGE_SIZE)) { 341 333 mutex_unlock(&area->lock); 342 } 334 return false; 335 } 336 337 mutex_unlock(&area->lock); 343 338 } 344 339 … … 347 342 area = (as_area_t *) node->value[0]; 348 343 349 if (area != avoid) { 350 mutex_lock(&area->lock); 351 352 if (overlaps(addr, count << PAGE_WIDTH, 353 area->base, area->pages << PAGE_WIDTH)) { 354 mutex_unlock(&area->lock); 355 return false; 356 } 357 344 mutex_lock(&area->lock); 345 346 if (overlaps(va, size, area->base, area->pages * PAGE_SIZE)) { 358 347 mutex_unlock(&area->lock); 359 } 348 return false; 349 } 350 351 mutex_unlock(&area->lock); 360 352 } 361 353 … … 365 357 area = (as_area_t *) leaf->value[i]; 366 358 367 if (area == avoid )359 if (area == avoid_area) 368 360 continue; 369 361 370 362 mutex_lock(&area->lock); 371 363 372 if (overlaps(addr, count << PAGE_WIDTH, 373 area->base, area->pages << PAGE_WIDTH)) { 364 if (overlaps(va, size, area->base, area->pages * PAGE_SIZE)) { 374 365 mutex_unlock(&area->lock); 375 366 return false; … … 384 375 */ 385 376 if (!KERNEL_ADDRESS_SPACE_SHADOWED) { 386 return !overlaps( addr, count << PAGE_WIDTH,377 return !overlaps(va, size, 387 378 KERNEL_ADDRESS_SPACE_START, 388 379 KERNEL_ADDRESS_SPACE_END - KERNEL_ADDRESS_SPACE_START); … … 411 402 mem_backend_data_t *backend_data) 412 403 { 413 if ( (base % PAGE_SIZE) != 0)404 if (base % PAGE_SIZE) 414 405 return NULL; 415 406 416 if ( size == 0)407 if (!size) 417 408 return NULL; 418 419 size_t pages = SIZE2FRAMES(size);420 409 421 410 /* Writeable executable areas are not supported. */ … … 425 414 mutex_lock(&as->lock); 426 415 427 if (!check_area_conflicts(as, base, pages, NULL)) {416 if (!check_area_conflicts(as, base, size, NULL)) { 428 417 mutex_unlock(&as->lock); 429 418 return NULL; … … 437 426 area->flags = flags; 438 427 area->attributes = attrs; 439 area->pages = pages;428 area->pages = SIZE2FRAMES(size); 440 429 area->resident = 0; 441 430 area->base = base; … … 491 480 mutex_lock(&area->lock); 492 481 493 if ((area->base <= va) && 494 (va < area->base + (area->pages << PAGE_WIDTH))) 482 if ((area->base <= va) && (va < area->base + area->pages * PAGE_SIZE)) 495 483 return area; 496 484 … … 508 496 mutex_lock(&area->lock); 509 497 510 if (va < area->base + (area->pages << PAGE_WIDTH))498 if (va < area->base + area->pages * PAGE_SIZE) 511 499 return area; 512 500 … … 573 561 574 562 if (pages < area->pages) { 575 uintptr_t start_free = area->base + (pages << PAGE_WIDTH);563 uintptr_t start_free = area->base + pages * PAGE_SIZE; 576 564 577 565 /* … … 586 574 */ 587 575 ipl_t ipl = tlb_shootdown_start(TLB_INVL_PAGES, as->asid, 588 area->base + (pages << PAGE_WIDTH), area->pages - pages);576 area->base + pages * PAGE_SIZE, area->pages - pages); 589 577 590 578 /* … … 609 597 size_t i = 0; 610 598 611 if (overlaps(ptr, size << PAGE_WIDTH, area->base,612 pages << PAGE_WIDTH)) {599 if (overlaps(ptr, size * PAGE_SIZE, area->base, 600 pages * PAGE_SIZE)) { 613 601 614 if (ptr + (size << PAGE_WIDTH)<= start_free) {602 if (ptr + size * PAGE_SIZE <= start_free) { 615 603 /* 616 604 * The whole interval fits … … 644 632 for (; i < size; i++) { 645 633 pte_t *pte = page_mapping_find(as, ptr + 646 (i << PAGE_WIDTH));634 i * PAGE_SIZE); 647 635 648 636 ASSERT(pte); … … 653 641 (area->backend->frame_free)) { 654 642 area->backend->frame_free(area, 655 ptr + (i << PAGE_WIDTH),643 ptr + i * PAGE_SIZE, 656 644 PTE_GET_FRAME(pte)); 657 645 } 658 646 659 647 page_mapping_remove(as, ptr + 660 (i << PAGE_WIDTH));648 i * PAGE_SIZE); 661 649 } 662 650 } … … 667 655 */ 668 656 669 tlb_invalidate_pages(as->asid, area->base + (pages << PAGE_WIDTH),657 tlb_invalidate_pages(as->asid, area->base + pages * PAGE_SIZE, 670 658 area->pages - pages); 671 659 … … 674 662 */ 675 663 as_invalidate_translation_cache(as, area->base + 676 (pages << PAGE_WIDTH), area->pages - pages);664 pages * PAGE_SIZE, area->pages - pages); 677 665 tlb_shootdown_finalize(ipl); 678 666 … … 683 671 * Check for overlaps with other address space areas. 684 672 */ 685 if (!check_area_conflicts(as, address, pages, area)) { 673 if (!check_area_conflicts(as, address, pages * PAGE_SIZE, 674 area)) { 686 675 mutex_unlock(&area->lock); 687 676 mutex_unlock(&as->lock); … … 782 771 783 772 for (size = 0; size < (size_t) node->value[i]; size++) { 784 pte_t *pte = 785 page_mapping_find(as, ptr + (size << PAGE_WIDTH)); 773 pte_t *pte = page_mapping_find(as, ptr + size * PAGE_SIZE); 786 774 787 775 ASSERT(pte); … … 792 780 (area->backend->frame_free)) { 793 781 area->backend->frame_free(area, 794 ptr + (size << PAGE_WIDTH), PTE_GET_FRAME(pte));782 ptr + size * PAGE_SIZE, PTE_GET_FRAME(pte)); 795 783 } 796 784 797 page_mapping_remove(as, ptr + (size << PAGE_WIDTH));785 page_mapping_remove(as, ptr + size * PAGE_SIZE); 798 786 } 799 787 } … … 882 870 } 883 871 884 size_t src_size = src_area->pages << PAGE_WIDTH;872 size_t src_size = src_area->pages * PAGE_SIZE; 885 873 unsigned int src_flags = src_area->flags; 886 874 mem_backend_t *src_backend = src_area->backend; … … 1088 1076 1089 1077 for (size = 0; size < (size_t) node->value[i]; size++) { 1090 pte_t *pte = 1091 page_mapping_find(as, ptr + (size << PAGE_WIDTH)); 1078 pte_t *pte = page_mapping_find(as, ptr + size * PAGE_SIZE); 1092 1079 1093 1080 ASSERT(pte); … … 1098 1085 1099 1086 /* Remove old mapping */ 1100 page_mapping_remove(as, ptr + (size << PAGE_WIDTH));1087 page_mapping_remove(as, ptr + size * PAGE_SIZE); 1101 1088 } 1102 1089 } … … 1144 1131 1145 1132 /* Insert the new mapping */ 1146 page_mapping_insert(as, ptr + (size << PAGE_WIDTH),1133 page_mapping_insert(as, ptr + size * PAGE_SIZE, 1147 1134 old_frame[frame_idx++], page_flags); 1148 1135 … … 1466 1453 1467 1454 if (src_area) { 1468 size = src_area->pages << PAGE_WIDTH;1455 size = src_area->pages * PAGE_SIZE; 1469 1456 mutex_unlock(&src_area->lock); 1470 1457 } else … … 1521 1508 if (page >= right_pg) { 1522 1509 /* Do nothing. */ 1523 } else if (overlaps(page, count << PAGE_WIDTH, left_pg,1524 left_cnt << PAGE_WIDTH)) {1510 } else if (overlaps(page, count * PAGE_SIZE, left_pg, 1511 left_cnt * PAGE_SIZE)) { 1525 1512 /* The interval intersects with the left interval. */ 1526 1513 return false; 1527 } else if (overlaps(page, count << PAGE_WIDTH, right_pg,1528 right_cnt << PAGE_WIDTH)) {1514 } else if (overlaps(page, count * PAGE_SIZE, right_pg, 1515 right_cnt * PAGE_SIZE)) { 1529 1516 /* The interval intersects with the right interval. */ 1530 1517 return false; 1531 } else if ((page == left_pg + (left_cnt << PAGE_WIDTH)) &&1532 (page + (count << PAGE_WIDTH)== right_pg)) {1518 } else if ((page == left_pg + left_cnt * PAGE_SIZE) && 1519 (page + count * PAGE_SIZE == right_pg)) { 1533 1520 /* 1534 1521 * The interval can be added by merging the two already … … 1538 1525 btree_remove(&area->used_space, right_pg, leaf); 1539 1526 goto success; 1540 } else if (page == left_pg + (left_cnt << PAGE_WIDTH)) {1527 } else if (page == left_pg + left_cnt * PAGE_SIZE) { 1541 1528 /* 1542 1529 * The interval can be added by simply growing the left … … 1545 1532 node->value[node->keys - 1] += count; 1546 1533 goto success; 1547 } else if (page + (count << PAGE_WIDTH)== right_pg) {1534 } else if (page + count * PAGE_SIZE == right_pg) { 1548 1535 /* 1549 1536 * The interval can be addded by simply moving base of … … 1572 1559 */ 1573 1560 1574 if (overlaps(page, count << PAGE_WIDTH, right_pg,1575 right_cnt << PAGE_WIDTH)) {1561 if (overlaps(page, count * PAGE_SIZE, right_pg, 1562 right_cnt * PAGE_SIZE)) { 1576 1563 /* The interval intersects with the right interval. */ 1577 1564 return false; 1578 } else if (page + (count << PAGE_WIDTH)== right_pg) {1565 } else if (page + count * PAGE_SIZE == right_pg) { 1579 1566 /* 1580 1567 * The interval can be added by moving the base of the … … 1611 1598 if (page < left_pg) { 1612 1599 /* Do nothing. */ 1613 } else if (overlaps(page, count << PAGE_WIDTH, left_pg,1614 left_cnt << PAGE_WIDTH)) {1600 } else if (overlaps(page, count * PAGE_SIZE, left_pg, 1601 left_cnt * PAGE_SIZE)) { 1615 1602 /* The interval intersects with the left interval. */ 1616 1603 return false; 1617 } else if (overlaps(page, count << PAGE_WIDTH, right_pg,1618 right_cnt << PAGE_WIDTH)) {1604 } else if (overlaps(page, count * PAGE_SIZE, right_pg, 1605 right_cnt * PAGE_SIZE)) { 1619 1606 /* The interval intersects with the right interval. */ 1620 1607 return false; 1621 } else if ((page == left_pg + (left_cnt << PAGE_WIDTH)) &&1622 (page + (count << PAGE_WIDTH)== right_pg)) {1608 } else if ((page == left_pg + left_cnt * PAGE_SIZE) && 1609 (page + count * PAGE_SIZE == right_pg)) { 1623 1610 /* 1624 1611 * The interval can be added by merging the two already … … 1628 1615 btree_remove(&area->used_space, right_pg, node); 1629 1616 goto success; 1630 } else if (page == left_pg + (left_cnt << PAGE_WIDTH)) {1617 } else if (page == left_pg + left_cnt * PAGE_SIZE) { 1631 1618 /* 1632 1619 * The interval can be added by simply growing the left … … 1635 1622 leaf->value[leaf->keys - 1] += count; 1636 1623 goto success; 1637 } else if (page + (count << PAGE_WIDTH)== right_pg) {1624 } else if (page + count * PAGE_SIZE == right_pg) { 1638 1625 /* 1639 1626 * The interval can be addded by simply moving base of … … 1662 1649 */ 1663 1650 1664 if (overlaps(page, count << PAGE_WIDTH, left_pg,1665 left_cnt << PAGE_WIDTH)) {1651 if (overlaps(page, count * PAGE_SIZE, left_pg, 1652 left_cnt * PAGE_SIZE)) { 1666 1653 /* The interval intersects with the left interval. */ 1667 1654 return false; 1668 } else if (left_pg + (left_cnt << PAGE_WIDTH)== page) {1655 } else if (left_pg + left_cnt * PAGE_SIZE == page) { 1669 1656 /* 1670 1657 * The interval can be added by growing the left … … 1701 1688 */ 1702 1689 1703 if (overlaps(page, count << PAGE_WIDTH, left_pg,1704 left_cnt << PAGE_WIDTH)) {1690 if (overlaps(page, count * PAGE_SIZE, left_pg, 1691 left_cnt * PAGE_SIZE)) { 1705 1692 /* 1706 1693 * The interval intersects with the left … … 1708 1695 */ 1709 1696 return false; 1710 } else if (overlaps(page, count << PAGE_WIDTH, right_pg,1711 right_cnt << PAGE_WIDTH)) {1697 } else if (overlaps(page, count * PAGE_SIZE, right_pg, 1698 right_cnt * PAGE_SIZE)) { 1712 1699 /* 1713 1700 * The interval intersects with the right … … 1715 1702 */ 1716 1703 return false; 1717 } else if ((page == left_pg + (left_cnt << PAGE_WIDTH)) &&1718 (page + (count << PAGE_WIDTH)== right_pg)) {1704 } else if ((page == left_pg + left_cnt * PAGE_SIZE) && 1705 (page + count * PAGE_SIZE == right_pg)) { 1719 1706 /* 1720 1707 * The interval can be added by merging the two … … 1724 1711 btree_remove(&area->used_space, right_pg, leaf); 1725 1712 goto success; 1726 } else if (page == left_pg + (left_cnt << PAGE_WIDTH)) {1713 } else if (page == left_pg + left_cnt * PAGE_SIZE) { 1727 1714 /* 1728 1715 * The interval can be added by simply growing … … 1731 1718 leaf->value[i - 1] += count; 1732 1719 goto success; 1733 } else if (page + (count << PAGE_WIDTH)== right_pg) {1720 } else if (page + count * PAGE_SIZE == right_pg) { 1734 1721 /* 1735 1722 * The interval can be addded by simply moving … … 1797 1784 for (i = 0; i < leaf->keys; i++) { 1798 1785 if (leaf->key[i] == page) { 1799 leaf->key[i] += count << PAGE_WIDTH;1786 leaf->key[i] += count * PAGE_SIZE; 1800 1787 leaf->value[i] -= count; 1801 1788 goto success; … … 1812 1799 size_t left_cnt = (size_t) node->value[node->keys - 1]; 1813 1800 1814 if (overlaps(left_pg, left_cnt << PAGE_WIDTH, page,1815 count << PAGE_WIDTH)) {1816 if (page + (count << PAGE_WIDTH)==1817 left_pg + (left_cnt << PAGE_WIDTH)) {1801 if (overlaps(left_pg, left_cnt * PAGE_SIZE, page, 1802 count * PAGE_SIZE)) { 1803 if (page + count * PAGE_SIZE == 1804 left_pg + left_cnt * PAGE_SIZE) { 1818 1805 /* 1819 1806 * The interval is contained in the rightmost … … 1824 1811 node->value[node->keys - 1] -= count; 1825 1812 goto success; 1826 } else if (page + (count << PAGE_WIDTH)<1827 left_pg + (left_cnt << PAGE_WIDTH)) {1813 } else if (page + count * PAGE_SIZE < 1814 left_pg + left_cnt*PAGE_SIZE) { 1828 1815 /* 1829 1816 * The interval is contained in the rightmost … … 1833 1820 * new interval. 1834 1821 */ 1835 size_t new_cnt = ((left_pg + (left_cnt << PAGE_WIDTH)) -1836 (page + (count << PAGE_WIDTH))) >> PAGE_WIDTH;1822 size_t new_cnt = ((left_pg + left_cnt * PAGE_SIZE) - 1823 (page + count*PAGE_SIZE)) >> PAGE_WIDTH; 1837 1824 node->value[node->keys - 1] -= count + new_cnt; 1838 1825 btree_insert(&area->used_space, page + 1839 (count << PAGE_WIDTH), (void *) new_cnt, leaf);1826 count * PAGE_SIZE, (void *) new_cnt, leaf); 1840 1827 goto success; 1841 1828 } … … 1850 1837 size_t left_cnt = (size_t) leaf->value[leaf->keys - 1]; 1851 1838 1852 if (overlaps(left_pg, left_cnt << PAGE_WIDTH, page,1853 count << PAGE_WIDTH)) {1854 if (page + (count << PAGE_WIDTH)==1855 left_pg + (left_cnt << PAGE_WIDTH)) {1839 if (overlaps(left_pg, left_cnt * PAGE_SIZE, page, 1840 count * PAGE_SIZE)) { 1841 if (page + count * PAGE_SIZE == 1842 left_pg + left_cnt * PAGE_SIZE) { 1856 1843 /* 1857 1844 * The interval is contained in the rightmost … … 1861 1848 leaf->value[leaf->keys - 1] -= count; 1862 1849 goto success; 1863 } else if (page + (count << PAGE_WIDTH)< left_pg +1864 (left_cnt << PAGE_WIDTH)) {1850 } else if (page + count * PAGE_SIZE < left_pg + 1851 left_cnt * PAGE_SIZE) { 1865 1852 /* 1866 1853 * The interval is contained in the rightmost … … 1870 1857 * interval. 1871 1858 */ 1872 size_t new_cnt = ((left_pg + (left_cnt << PAGE_WIDTH)) -1873 (page + (count << PAGE_WIDTH))) >> PAGE_WIDTH;1859 size_t new_cnt = ((left_pg + left_cnt * PAGE_SIZE) - 1860 (page + count * PAGE_SIZE)) >> PAGE_WIDTH; 1874 1861 leaf->value[leaf->keys - 1] -= count + new_cnt; 1875 1862 btree_insert(&area->used_space, page + 1876 (count << PAGE_WIDTH), (void *) new_cnt, leaf);1863 count * PAGE_SIZE, (void *) new_cnt, leaf); 1877 1864 goto success; 1878 1865 } … … 1896 1883 * to (i - 1) and i. 1897 1884 */ 1898 if (overlaps(left_pg, left_cnt << PAGE_WIDTH, page,1899 count << PAGE_WIDTH)) {1900 if (page + (count << PAGE_WIDTH)==1901 left_pg + (left_cnt << PAGE_WIDTH)) {1885 if (overlaps(left_pg, left_cnt * PAGE_SIZE, page, 1886 count * PAGE_SIZE)) { 1887 if (page + count * PAGE_SIZE == 1888 left_pg + left_cnt*PAGE_SIZE) { 1902 1889 /* 1903 1890 * The interval is contained in the … … 1908 1895 leaf->value[i - 1] -= count; 1909 1896 goto success; 1910 } else if (page + (count << PAGE_WIDTH)<1911 left_pg + (left_cnt << PAGE_WIDTH)) {1897 } else if (page + count * PAGE_SIZE < 1898 left_pg + left_cnt * PAGE_SIZE) { 1912 1899 /* 1913 1900 * The interval is contained in the … … 1918 1905 */ 1919 1906 size_t new_cnt = ((left_pg + 1920 (left_cnt << PAGE_WIDTH)) -1921 (page + (count << PAGE_WIDTH))) >>1907 left_cnt * PAGE_SIZE) - 1908 (page + count * PAGE_SIZE)) >> 1922 1909 PAGE_WIDTH; 1923 1910 leaf->value[i - 1] -= count + new_cnt; 1924 1911 btree_insert(&area->used_space, page + 1925 (count << PAGE_WIDTH), (void *) new_cnt,1912 count * PAGE_SIZE, (void *) new_cnt, 1926 1913 leaf); 1927 1914 goto success; … … 1949 1936 sysarg_t sys_as_area_create(uintptr_t address, size_t size, unsigned int flags) 1950 1937 { 1951 if (as_area_create(AS, flags , size, address,1938 if (as_area_create(AS, flags | AS_AREA_CACHEABLE, size, address, 1952 1939 AS_AREA_ATTR_NONE, &anon_backend, NULL)) 1953 1940 return (sysarg_t) address; … … 1972 1959 { 1973 1960 return (sysarg_t) as_area_destroy(AS, address); 1974 }1975 1976 /** Return pointer to unmapped address space area1977 *1978 * @param base Lowest address bound.1979 * @param size Requested size of the allocation.1980 *1981 * @return Pointer to the beginning of unmapped address space area.1982 *1983 */1984 sysarg_t sys_as_get_unmapped_area(uintptr_t base, size_t size)1985 {1986 if (size == 0)1987 return 0;1988 1989 /*1990 * Make sure we allocate from page-aligned1991 * address. Check for possible overflow in1992 * each step.1993 */1994 1995 size_t pages = SIZE2FRAMES(size);1996 uintptr_t ret = 0;1997 1998 /*1999 * Find the lowest unmapped address aligned on the sz2000 * boundary, not smaller than base and of the required size.2001 */2002 2003 mutex_lock(&AS->lock);2004 2005 /* First check the base address itself */2006 uintptr_t addr = ALIGN_UP(base, PAGE_SIZE);2007 if ((addr >= base) &&2008 (check_area_conflicts(AS, addr, pages, NULL)))2009 ret = addr;2010 2011 /* Eventually check the addresses behind each area */2012 link_t *cur;2013 for (cur = AS->as_area_btree.leaf_head.next;2014 (ret == 0) && (cur != &AS->as_area_btree.leaf_head);2015 cur = cur->next) {2016 btree_node_t *node =2017 list_get_instance(cur, btree_node_t, leaf_link);2018 2019 btree_key_t i;2020 for (i = 0; (ret == 0) && (i < node->keys); i++) {2021 as_area_t *area = (as_area_t *) node->value[i];2022 2023 mutex_lock(&area->lock);2024 2025 uintptr_t addr =2026 ALIGN_UP(area->base + (area->pages << PAGE_WIDTH),2027 PAGE_SIZE);2028 2029 if ((addr >= base) && (addr >= area->base) &&2030 (check_area_conflicts(AS, addr, pages, area)))2031 ret = addr;2032 2033 mutex_unlock(&area->lock);2034 }2035 }2036 2037 mutex_unlock(&AS->lock);2038 2039 return (sysarg_t) ret;2040 1961 } 2041 1962 … … 2106 2027 mutex_lock(&as->lock); 2107 2028 2108 /* Print out info about address space areas */2029 /* print out info about address space areas */ 2109 2030 link_t *cur; 2110 2031 for (cur = as->as_area_btree.leaf_head.next;
Note:
See TracChangeset
for help on using the changeset viewer.
