//===- DataflowWorklist.h ---------------------------------------*- C++ -*-===// // // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. // See https://llvm.org/LICENSE.txt for license information. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception // //===----------------------------------------------------------------------===// // // A simple and reusable worklist for flow-sensitive analyses. // //===----------------------------------------------------------------------===// #ifndef LLVM_CLANG_ANALYSIS_FLOWSENSITIVE_DATAFLOWWORKLIST_H #define LLVM_CLANG_ANALYSIS_FLOWSENSITIVE_DATAFLOWWORKLIST_H #include "clang/Analysis/Analyses/IntervalPartition.h" #include "clang/Analysis/Analyses/PostOrderCFGView.h" #include "clang/Analysis/CFG.h" #include "llvm/ADT/PriorityQueue.h" namespace clang { /// A worklist implementation where the enqueued blocks will be dequeued based /// on the order defined by 'Comp'. template <typename Comp, unsigned QueueSize> class DataflowWorklistBase { … }; struct ReversePostOrderCompare { … }; /// A worklist implementation for forward dataflow analysis. The enqueued /// blocks will be dequeued in reverse post order. The worklist cannot contain /// the same block multiple times at once. struct ForwardDataflowWorklist : DataflowWorklistBase<ReversePostOrderCompare, 20> { … }; /// A worklist implementation for forward dataflow analysis based on a weak /// topological ordering of the nodes. The worklist cannot contain the same /// block multiple times at once. struct WTODataflowWorklist : DataflowWorklistBase<WTOCompare, 20> { … }; /// A worklist implementation for backward dataflow analysis. The enqueued /// block will be dequeued in post order. The worklist cannot contain the same /// block multiple times at once. struct BackwardDataflowWorklist : DataflowWorklistBase<PostOrderCFGView::BlockOrderCompare, 20> { … }; } // namespace clang #endif // LLVM_CLANG_ANALYSIS_FLOWSENSITIVE_DATAFLOWWORKLIST_H