lab2_练习1（已优化）

最新推荐文章于 2021-05-26 22:07:17 发布

smmrSangria

最新推荐文章于 2021-05-26 22:07:17 发布

阅读量296

点赞数

分类专栏： ucore

本文链接：https://blog.youkuaiyun.com/Anna__1997/article/details/88701559

版权

ucore 专栏收录该内容

15 篇文章

订阅专栏

博客围绕lab2练习1展开，已对其进行优化，但具体优化内容暂未提供。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

static void
default_free_pages(struct Page *base, size_t n) {
    assert(n > 0);
    struct Page *p = base;
    for (; p != base + n; p ++) {
        assert(!PageReserved(p) && !PageProperty(p));
        p->flags = 0;
        set_page_ref(p, 0);
    }
    base->property = n;
    SetPageProperty(base);
    list_entry_t *le = list_next(&free_list);
    int vis = 0;
    while (le != &free_list) {
        p = le2page(le, page_link);
       // le = list_next(le);
        // TODO: optimize
        if (base + base->property == p) {
            base->property += p->property;
            ClearPageProperty(p);
            list_del(&(p->page_link));
        }
        else if (p + p->property == base) {
            p->property += base->property;
            ClearPageProperty(base);
            base = p;
            list_del(&(p->page_link));
        }
        else if (base + base->property < p)
        {
            break;
        }
        le = list_next(le);
    }


    list_add_before(le, &(base->page_link));

    nr_free += n;

    /*
    le = list_next(&free_list);
    while (le != &free_list) {
        p = le2page(le, page_link);
        if (base + base->property <= p) {
            assert(base + base->property != p);
            break;
        }
        le = list_next(le);
    }
    list_add_before(le, &(base->page_link));*/
}