On the impact of naming methods for heap-oriented pointers in C programs

Tong Chen, Jin Lin, W. Hsu, P. Yew
{"title":"On the impact of naming methods for heap-oriented pointers in C programs","authors":"Tong Chen, Jin Lin, W. Hsu, P. Yew","doi":"10.1109/ISPAN.2002.1004290","DOIUrl":null,"url":null,"abstract":"Many applications written in C allocate memory blocks for their major data structures from the heap space at run time. The analysis of heap-oriented pointers in such programs is critical for compilers to generate high-performance code. However, most previous research on pointer analysis mostly focuses on pointers pointing to global or local variables. In this paper, we study points-to analysis of heap-oriented pointers using profiling information. An instrumentation tool and a set of library routines are developed to measure points-to sets of memory references at run time. Different naming methods for heap-oriented pointers are studied. We found that it is very important to adopt appropriate naming methods to recognize wrapper functions for memory allocation and memory management functions defined by users. Based on these naming methods, the approaches in pointer analysis, such as flow sensitivity and context sensitivity, are examined with the run-time tool. The program characteristics are observed at run time to evaluate what kind of compiler analysis is needed. Experiments are conducted on SPEC CPU2000 integer benchmarks. We found that flow sensitivity and context sensitivity have little impact on the analysis of heap-oriented pointers.","PeriodicalId":255069,"journal":{"name":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPAN.2002.1004290","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Many applications written in C allocate memory blocks for their major data structures from the heap space at run time. The analysis of heap-oriented pointers in such programs is critical for compilers to generate high-performance code. However, most previous research on pointer analysis mostly focuses on pointers pointing to global or local variables. In this paper, we study points-to analysis of heap-oriented pointers using profiling information. An instrumentation tool and a set of library routines are developed to measure points-to sets of memory references at run time. Different naming methods for heap-oriented pointers are studied. We found that it is very important to adopt appropriate naming methods to recognize wrapper functions for memory allocation and memory management functions defined by users. Based on these naming methods, the approaches in pointer analysis, such as flow sensitivity and context sensitivity, are examined with the run-time tool. The program characteristics are observed at run time to evaluate what kind of compiler analysis is needed. Experiments are conducted on SPEC CPU2000 integer benchmarks. We found that flow sensitivity and context sensitivity have little impact on the analysis of heap-oriented pointers.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
C程序中面向堆指针命名方法的影响
许多用C编写的应用程序在运行时从堆空间为其主要数据结构分配内存块。在这类程序中,分析面向堆的指针对于编译器生成高性能代码至关重要。然而,以往对指针分析的研究大多集中在指向全局或局部变量的指针上。在本文中,我们研究了利用剖析信息进行面向堆指针的点对分析。开发了一种检测工具和一组库例程来测量运行时的点到内存引用集。研究了面向堆指针的不同命名方法。我们发现采用适当的命名方法来识别用户定义的内存分配和内存管理函数的包装函数是非常重要的。基于这些命名方法,使用运行时工具对指针分析中的流敏感和上下文敏感等方法进行了研究。在运行时观察程序特征,以评估需要哪种编译器分析。在speccpu2000整数基准上进行了实验。我们发现流敏感性和上下文敏感性对面向堆指针的分析影响很小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Data structures for one-dimensional packet classification using most-specific-rule matching Optimal multicast tree routing for cluster computing in hypercube interconnection networks An overview of data replication on the Internet Fault-tolerant routing on the star graph with safety vectors Automatic processor lower bound formulas for array computations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1