{"title":"An embedded cross-assembler optimization method","authors":"Songchao Liu, Huailiang Tan, Lei Huang","doi":"10.1109/CSIP.2012.6308935","DOIUrl":null,"url":null,"abstract":"In traditional peephole optimization, the size of the sliding window is fixed or limited, which makes it difficult to match and optimize instructions which are not lexically adjacent (logically adjacent). In this paper, a novel method for peephole optimization is proposed by using regular expression. The new way does not set the size of the sliding window and can easily identify instructions which are not lexically adjacent. The experimental results show that the new way improves the optimization capability of the cross-assembler.","PeriodicalId":193335,"journal":{"name":"2012 International Conference on Computer Science and Information Processing (CSIP)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Computer Science and Information Processing (CSIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSIP.2012.6308935","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In traditional peephole optimization, the size of the sliding window is fixed or limited, which makes it difficult to match and optimize instructions which are not lexically adjacent (logically adjacent). In this paper, a novel method for peephole optimization is proposed by using regular expression. The new way does not set the size of the sliding window and can easily identify instructions which are not lexically adjacent. The experimental results show that the new way improves the optimization capability of the cross-assembler.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
