[cfe-dev] A question on data flow analysis in clang
kremenek at apple.com
Tue Jan 21 15:40:27 PST 2014
To answer your question, I need to understand what you mean by "incremental". That term implies that there can be changes in the analysis results, somehow, when running the analysis multiple times. If you provided a bit of context, I could more precisely answer your question.
Operationally, analyses are typically implemented using a work list algorithm, which computes data flow values until a fix point is reached. This is a kind of incremental analysis, but I'm not certain if this is what you meant by "incremental."
> On Jan 12, 2014, at 9:56 PM, Mahesha S <mahesha.llvm at gmail.com> wrote:
> Hello all,
> I wanted to know that - the data flow analysis which is implemented in Clang (include/clang/Analysis) - is incremental analysis or it re-solves the equations at every CFG node?
> I will look into the source code, but, meanwhile, I thought of quickly getting "yes/no" answer before I spend time with source code.
> cfe-dev mailing list
> cfe-dev at cs.uiuc.edu
More information about the cfe-dev