MCPcopy Create free account
hub / github.com/argotorg/solidity / recursiveFunctions

Method recursiveFunctions

libyul/optimiser/CallGraphGenerator.cpp:66–73  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

64}
65
66std::set<FunctionHandle> CallGraph::recursiveFunctions() const
67{
68 CallGraphCycleFinder cycleFinder{*this};
69 // Visiting the root only is not enough, since there may be disconnected recursive functions.
70 for (auto const& call: functionCalls)
71 cycleFinder.visit(call.first);
72 return cycleFinder.containedInCycle;
73}
74
75CallGraph CallGraphGenerator::callGraph(Block const& _ast)
76{

Callers 5

recursiveFunctionExistsFunction · 0.80
runMethod · 0.80
runMethod · 0.80
FullInlinerMethod · 0.80
sideEffectsMethod · 0.80

Calls 1

visitMethod · 0.45

Tested by 1

runMethod · 0.64