2014年05月_wuhui_gdnt

11月 10月 09月 07月 06月 05月 04月

原创 dsa算法（3）

1.2.2.2. BasicDataStructure的算法下面的M是BasicDataStructures::runOnModule类型为Module的参数。Module类型用于保存一个llvm模块的所有信息，它是所有其它llvm中间表示对象的顶级容器。每个模块直接包含了一组全局变量，一组函数，该模块依赖的一组库（或其它模块），及关于目标特性的各种数据。 BasicDataStruc

2014-05-30 11:41:30 1244

原创 dsa算法（2）

1.2. BasicDataStructures遍就BasicDataStructures本身而言，它从DataStructures派生而来： 157 classBasicDataStructures: public DataStructures {158 public:159 static charID;160 BasicDataS

2014-05-22 11:37:18 1594

DSA算法（DataStructure Analysis的首字母缩写）是LLVM的发起人Chris Latter在其硕士、博士系列论文中提出的一个上下文感知（context sensitivity）的、过程间（inter-procedure）的数据结构分析算法。这个算法的强大之处在于可以分析像C这样拥有指针类型的复杂语言，并拥有可观的效率（在http://llvm.org/pubs/可以找到这篇论

2014-05-14 10:35:34 3430

原创 Llvm的类型转换系统

Llvm内置了一个类型转换系统，并定义了类似于dynamic_cast这样的转换函数。Llvm底层的很大部分是由模板类构成的，这个转换系统对于模板类间的类型判断及转换至为重要。以下只是描述这个转换系统的一个框架，该系统的正确实现，还依赖于参与模板类正确实现某些函数（下面会提到）。cast_retty类cast_or_null是llvm所提供的类型转换系统的部分，这是一个有趣的模板实现。这个

2014-05-04 11:59:59 3989

Introduction to Theory of Computation

This is a free textbook for an undergraduate course on the Theory of Computation, which we have been teaching at Carleton University since 2002.Until the 2011/2012 academic year, this course was offered as a second-year course (COMP 2805) and was compulsory for all Computer Science students. Starting with the 2012/2013 academic year, the course has been downgraded to a third-year optional course (COMP 3803).

2018-09-23

Survey on Instruction Selection

Instruction selection is one of three optimization problems involved in the code generator back-end of a compiler. The instruction selector is responsible of transforming an input program from its target-independent representation into a target-specific form by making best use of the available machine instructions. Hence instruction selection is a crucial part of efficient code generation.

2018-09-23

Towards a Compilation infrastructure for network processors

Modern network processors (NPs) typically resemble a highly-multithreaded multiprocessor-ona-chip, supporting a wide variety of mechanisms for on-chip storage and inter-task communication. NP applications are themselves composed of many threads that share memory and other resources,and synchronize and communicate frequently. In contrast, studies of new NP architectures and features are often performed by benchmarking a simulation model of the new NP using independent kernel programs that neither communicate nor share memory. In this paper we present a NP simulation infrastructure that (i) uses realistic NP applications that are multithreaded, share memory, synchronize, and communicate; and (ii) automatically maps these applications to a variety of NP architectures and features. We use our infrastructure to evaluate threading and scaling, on-chip storage and communication, and to suggest future techniques for automated compilation for NPs.

2018-09-23

Crafting a Compiler

Brief Contents 1 Introduction 1 2 A Simple Compiler 31 3 Scanning—Theory and Practice 57 4 Grammars and Parsing 113 5 Top-Down Parsing 143 6 Bottom-Up Parsing 179 7 Syntax-Directed Translation 235 8 Symbol Tables and Declaration Processing 279 9 Semantic Analysis 343 10 Intermediate Representations 391 11 Code Generation for a Virtual Machine 417 12 Runtime Support 445 13 Target Code Generation 489 14 Program Optimization 547

2018-09-01