Mercurial > hg > CbC > CbC_llvm

comparison tools/clang/docs/PTHInternals.rst @ 77:54457678186b LLVM3.6

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
LLVM 3.6
author Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
date Mon, 08 Sep 2014 22:06:00 +0900
parents 95c75e76d11b
children
comparison
equal deleted inserted replaced
34:e874dbf0ad9d 77:54457678186b
133 of PCH mitigates some of these algorithmic strengths via the use of 133 of PCH mitigates some of these algorithmic strengths via the use of
134 copy-on-write pages, the approach itself can fundamentally dominate at 134 copy-on-write pages, the approach itself can fundamentally dominate at
135 an algorithmic level, especially when one considers header files of 135 an algorithmic level, especially when one considers header files of
136 arbitrary size. 136 arbitrary size.
137 137
138 There are plans to potentially implement an complementary PCH 138 There is also a PCH implementation for Clang based on the lazy
139 implementation for Clang based on the lazy deserialization of ASTs. This 139 deserialization of ASTs. This approach theoretically has the same
140 approach would theoretically have the same constant-time algorithmic 140 constant-time algorithmic advantages just mentioned but also retains some
141 advantages just mentioned but would also retain some of the strengths of 141 of the strengths of PTH such as reduced memory pressure (ideal for
142 PTH such as reduced memory pressure (ideal for multi-core builds). 142 multi-core builds).
143 143
144 Internal PTH Optimizations 144 Internal PTH Optimizations
145 -------------------------- 145 --------------------------
146 146
147 While the main optimization employed by PTH is to reduce lexing time of 147 While the main optimization employed by PTH is to reduce lexing time of