Home
last modified time | relevance | path

Searched defs:Graph (Results 1 – 25 of 28) sorted by relevance

12

/llvm-project/llvm/include/llvm/Analysis/
H A DDOTGraphTraitsPass.h34 void viewGraphForFunction(Function &F, GraphT Graph, StringRef Name, in viewGraphForFunction() argument
67 GraphT Graph = AnalysisGraphTraitsT::getGraph(Result); in run() local
105 printGraphForFunction(Function & F,GraphT Graph,StringRef Name,bool IsSimple) printGraphForFunction() argument
150 GraphT Graph = AnalysisGraphTraitsT::getGraph(Result); run() local
205 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); runOnFunction() local
244 GraphT Graph = AnalysisGraphTraitsT::getGraph(&Analysis); runOnFunction() local
268 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); runOnModule() local
294 GraphT Graph = AnalysisGraphTraitsT::getGraph(&getAnalysis<AnalysisT>()); runOnModule() local
323 WriteDOTGraphToFile(Function & F,GraphT && Graph,std::string FileNamePrefix,bool IsSimple) WriteDOTGraphToFile() argument
[all...]
H A DDependenceGraphBuilder.h179 GraphType &Graph; variable
/llvm-project/clang/lib/Analysis/
H A DIntervalPartition.cpp105 static void fillIntervalNode(CFGIntervalGraph &Graph, in fillIntervalNode() argument
144 CFGIntervalGraph Graph; in partitionIntoIntervalsImpl() local
208 CFGIntervalGraph partitionIntoIntervals(const CFGIntervalGraph &Graph) { in partitionIntoIntervals() argument
218 internal::CFGIntervalGraph Graph = internal::partitionIntoIntervals(Cfg); getIntervalWTO() local
[all...]
/llvm-project/clang/unittests/Analysis/
H A DIntervalPartitionTest.cpp192 auto Graph = partitionIntoIntervals(*Result.getCFG()); in TEST() local
207 auto Graph = partitionIntoIntervals(*Result.getCFG()); in TEST() local
228 auto Graph = partitionIntoIntervals(*Result.getCFG()); in TEST() local
252 auto Graph = partitionIntoIntervals(*Result.getCFG()); in TEST() local
275 auto Graph = partitionIntoIntervals(*Result.getCFG()); in TEST() local
305 auto Graph = partitionIntoIntervals(*Result.getCFG()); in TEST() local
/llvm-project/llvm/docs/Proposals/
H A DTestSuite.rst306 Graph section in Generic Algorithms
309 Search Algorithms
317 Spanning Tree
/llvm-project/mlir/include/mlir/IR/
H A DRegionKindInterface.h28 Graph, enumerator
/llvm-project/llvm/include/llvm/ADT/
H A DGraphTraits.h98 const GraphType &Graph; global() member
/llvm-project/llvm/lib/Analysis/
H A DDDGPrinter.cpp60 const DataDependenceGraph *Graph) { in getNodeLabel()
78 const DataDependenceGraph *Graph) { in isNodeHidden()
H A DRegionPrinter.cpp35 RegionNode *Graph) { in getNodeLabel()
/llvm-project/llvm/tools/llvm-cfi-verify/
H A Dllvm-cfi-verify.cpp93 const GraphResult &Graph, in printInstructionInformation()
141 GraphResult Graph = GraphBuilder::buildFlowGraph(Analysis, Address); in printIndirectCFInstructions() local
/llvm-project/llvm/unittests/ADT/
H A DTestGraph.h108 Graph() { in Graph() function
164 friend class Graph; variable
/llvm-project/llvm/lib/Target/SPIRV/
H A DSPIRVDuplicatesTracker.cpp
/llvm-project/clang-tools-extra/pseudo/lib/grammar/
H A DLRTableBuild.cpp
/llvm-project/bolt/runtime/
H A Dinstr.cpp855 struct Graph { struct
856 uint32_t NumNodes;
857 Node *CFGNodes;
858 Node *SpanningTreeNodes;
859 uint64_t *EdgeFreqs;
860 uint64_t *CallFreqs;
861 BumpPtrAllocator &Alloc;
862 const FunctionDescription &D;
881 Graph::Graph(BumpPtrAllocator &Alloc, const FunctionDescription &D, in Graph() function in __anonc11c1cb60211::Graph
/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyFixIrreducibleControlFlow.cpp257 ReachabilityGraph Graph(Entry, Blocks); in processRegion() local
339 const ReachabilityGraph &Graph) { in makeSingleEntryLoop()
/llvm-project/llvm/unittests/XRay/
H A DGraphTest.cpp32 T Graph = getTestGraph(); member in __anonf740e1440111::GraphTest
/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h176 Graph(const Graph &Other) {} in Graph() function
344 Graph(GraphMetadata Metadata) : Metadata(std::move(Metadata)) {} in Graph() function
/llvm-project/llvm/include/llvm/Passes/
H A DStandardInstrumentations.h154 DenseMap<const BasicBlock *, DenseMap<const BasicBlock *, unsigned>> Graph; global() member
/llvm-project/llvm/include/llvm/CodeGen/
H A DRegAllocPBQP.h288 using Graph = PBQP::Graph<RegAllocSolverImpl>; variable
/llvm-project/llvm/lib/ExecutionEngine/Orc/
H A DDebugObjectManagerPlugin.cpp438 for (const Section &GraphSection : Graph.sections()) in modifyPassConfig() argument
/llvm-project/clang/lib/Analysis/FlowSensitive/
H A DHTMLLogger.cpp493 llvm::raw_string_ostream GraphS(Graph); in buildCFGDot() local
/llvm-project/clang/docs/
H A DInternalsManual.rst2092 structural-eqAbstract Syntax Graph global() argument
/llvm-project/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp275 std::unique_ptr<MachineGadgetGraph> Graph = getGadgetGraph(MF, MLI, MDT, MDF); runOnMachineFunction() local
[all...]
/llvm-project/clang/tools/clang-scan-deps/
H A DClangScanDeps.cpp387 mergeDeps(ModuleDepsGraph Graph,size_t InputIndex) mergeDeps() argument
/llvm-project/clang/test/SemaCXX/
H A Dwarn-thread-safety-parsing.cpp1419 class Graph { global() class

12