547   /// Meet \p A and \p B, storing the result in \p A.
549     // Meet A and B.  in meetVars()
551     // Result = meet(a, b) for a in A, b in B where Var(a) == Var(b)  in meetVars()
560       LLVM_DEBUG(dbgs() << "meet fragment maps for "  in meetVars()
566   bool meet(const BasicBlock &BB,  in meet()  function in __anon3afac2c40211::MemLocFragmentFill
568     LLVM_DEBUG(dbgs() << "meet block info from preds of " << BB.getName()  in meet()
573     // LiveIn locs for BB is the meet of the already-processed preds' LiveOut  in meet()
578       // the identity value for the meet operation.  in meet()
590         LLVM_DEBUG(dbgs() << "BBLiveIn = meet BBLiveIn, " << Pred->getName()  in meet()
595       // An empty set is ⊥ for the intersect-like meet operation. If we've  in meet()
597       // ⊥ since `meet(a, ⊥) = ⊥`.  in meet()
605       LLVM_DEBUG(dbgs() << "change=true (first) on meet on " << BB.getName()  in meet()
614       LLVM_DEBUG(dbgs() << "change=true on meet on " << BB.getName() << "\n");  in meet()
619     LLVM_DEBUG(dbgs() << "change=false on meet on " << BB.getName() << "\n");  in meet()
907     // solve it, we perform meet() and process() using the two worklist method  in run()
910     // This dataflow is essentially working on maps of sets and at each meet we  in run()
924         bool InChanged = meet(*BB, Visited);  in run()