Lines Matching defs:MaxDepth

13661   auto VisitFrom = [&](auto &&Self, const SDNode *N, int MaxDepth) {
13662     if (MaxDepth == 0) {
13663       // Remember this node in case we need to increase MaxDepth and continue
13671       Self(Self, Op.getNode(), MaxDepth - 1);
13692   // We first try with a lower MaxDepth, assuming that the path to common
13694   // improves performance in the common case. The initial MaxDepth is big
13695   // enough to avoid retry in the common case; the last MaxDepth is large
13698   for (int PrevDepth = 0, MaxDepth = 16; MaxDepth <= 1024;
13699        PrevDepth = MaxDepth, MaxDepth *= 2, Visited.clear()) {
13705       VisitFrom(VisitFrom, N, MaxDepth - PrevDepth);
13709     LLVM_DEBUG(dbgs() << __func__ << ": MaxDepth=" << MaxDepth << " too low\n");
13714   // from From has depth greater or equal to maximum MaxDepth, and VisitFrom()
13718   assert(false && "From subgraph too complex - increase max. MaxDepth?");