search for: agorithm

This adds [f]getc() and fgets() for parsing config files. Probably hard to avoid. Still trying to decide if I actually want to add system() or not. -hpa

...t; function passes? Do we re-visit this new enlarged SCC? (if so, when?) These >> are the types of questions that motivated this post (hence the name >> "Intended behavior of CGSCC pass manager."). >> >> yes, I understand the motivation -- that is way I propose the agorithm > that uses cached iteration order + worklist based iterative approach. In > your example, when a new edge is exposed via devirtualization, only its > caller/ancestor nodes need to be revisited in the next iteration. > Your proposal certainly sounds simpler and easier to reason about....

On Wed, Jun 8, 2016 at 12:31 PM, Xinliang David Li <davidxl at google.com> wrote: > > > On Wed, Jun 8, 2016 at 4:19 AM, Sean Silva <chisophugis at gmail.com> wrote: > >> Hi Chandler, Philip, Mehdi, (and llvm-dev,) >> >> (this is partially a summary of some discussions that happened at the >> last LLVM bay area social, and partially a discussion

...it this new enlarged SCC? (if so, when?) These >>>> are the types of questions that motivated this post (hence the name >>>> "Intended behavior of CGSCC pass manager."). >>>> >>>> yes, I understand the motivation -- that is way I propose the agorithm >>> that uses cached iteration order + worklist based iterative approach. In >>> your example, when a new edge is exposed via devirtualization, only its >>> caller/ancestor nodes need to be revisited in the next iteration. >>> >> >> Your proposal cert...