Dynamic Memory Allocation I - HMC Computer Science动态内存分配我- HMC的计算机科学.pptVIP

Dynamic Memory Allocation I - HMC Computer Science动态内存分配我- HMC的计算机科学.ppt

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Dynamic Memory Allocation I - HMC Computer Science动态内存分配我- HMC的计算机科学

Dynamic Memory Allocation I Topics Simple explicit allocators Data structures Mechanisms Policies Harsh Reality Memory Matters Memory is not unbounded It must be allocated and managed Many applications are memory-dominated Memory referencing bugs especially pernicious Effects are distant in both time and space Memory performance is not uniform Cache and virtual-memory effects can greatly affect program performance Adapting program to characteristics of memory system can lead to major speed improvements Dynamic Memory Allocation Explicit vs. Implicit Memory Allocator Explicit: application allocates and frees space E.g., malloc and free in C Semi-implicit: application allocates, but does not free space E.g. garbage collection in Java Implicit: allocation and freeing done under covers ML, Lisp, Python, Perl, Ruby Allocation In all cases allocator provides abstraction of memory as set of blocks Doles out free memory blocks to application Done by run-time system (mostly in user mode) Process Memory Image Malloc Package #include stdlib.h void *malloc(size_t size) If successful: Returns a pointer to a memory block of at least size bytes, aligned to 8-byte boundary (typically) If size == 0, returns NULL (design flaw) If unsuccessful: returns NULL (0) and sets errno void free(void *p) Returns the block pointed to by p to pool of available memory p MUST come from a previous call to malloc or realloc NULL not a legal argument (design flaw, sigh) void *realloc(void *p, size_t size) Changes size of block p and returns pointer to new block NULL not legal for p Contents of new block unchanged up to min of old and new size Malloc Example Assumptions Assumptions made in this lecture Memory is byte-addressed Words are 4 bytes Pointer fits in a word (4 bytes) All diagrams are word-based Allocation Examples Constraints Applications: Can issue arbitrary sequence of allocation and free requests Free requests must correspond to an allocated block—i.e., pointer must be correct Allo

文档评论(0)

wuyoujun92 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档