Lines Matching defs:AvailableIn

296   AvailableValueSet AvailableIn;
301   // AvailableOut minus AvailableIn.
305   // True if this block contains a safepoint and thus AvailableIn does not
496   /// Iterates over all BBs from BlockMap and recalculates AvailableIn/Out for
558   // Initialize AvailableIn/Out sets of each BB using only information about
561     gatherDominatingDefs(BBI.first, BBI.second->AvailableIn, DT);
565   // Simulate the flow of defs through the CFG and recalculate AvailableIn/Out
596     // We destructively modify AvailableIn as we traverse the block instruction
598     AvailableValueSet &AvailableSet = BBS->AvailableIn;
621   // This loop iterates the AvailableIn/Out sets until it converges.
622   // The AvailableIn and AvailableOut sets decrease as we iterate.
629     size_t OldInCount = BBS->AvailableIn.size();
634         set_intersect(BBS->AvailableIn, PBBS->AvailableOut);
637     assert(OldInCount >= BBS->AvailableIn.size() && "invariant!");
639     bool InputsChanged = OldInCount != BBS->AvailableIn.size();
659   AvailableValueSet AvailableSet = BBS->AvailableIn;
769   const AvailableValueSet &AvailableIn = BBS.AvailableIn;
778     // longer in our AvailableIn
780     set_union(Temp, AvailableIn);
785              PrintValueSet(dbgs(), AvailableIn.begin(), AvailableIn.end());