首页
学习
活动
专区
圈层
工具
发布
    • 综合排序
    • 最热优先
    • 最新优先
    时间不限
  • 来自专栏赤道企鹅的博客

    [heap] House of Orange 堆利用技巧

    = 0)); 将这些限制总结起来就是: 分配大小限制: 分配的chunk大小小于128K(此时将使用brk拓展堆,否则将使用mmap) 分配的chunk大小应大于被修改后的Top Chunk大小减去 fencepost

    42130编辑于 2022-08-01
  • 来自专栏ChaMd5安全团队

    RCTF WriteUp(Web篇+PWN篇)

    heap)); set_head (top (av), (heap->size - sizeof (*heap)) | PREV_INUSE); /* Setup fencepost free the old top chunk with a multiple of MALLOC_ALIGNMENT in size. */ /* The fencepost

    2K30发布于 2019-06-02
  • 来自专栏蓝天

    arean.c

    prev_heap, prev_heap->size - (MINSIZE-2*SIZE_SZ));     assert(p->size == (0|PREV_INUSE)); /* must be fencepost

    87030发布于 2019-03-14
  • 来自专栏蓝天

    malloc.c

    (*heap));       set_head(top(av), (heap->size - sizeof(*heap)) | PREV_INUSE); /* Setup fencepost and free the old top chunk. */ /* The fencepost takes at least MINSIZE bytes, because it might Insert a      double fencepost at old_top to prevent consolidation with space      we don't We need the fencepost, even if old_top otherwise gets      lost. */      chunk_at_offset

    5.4K20发布于 2019-03-14
领券