Transforms/IPO/AttributorAttributes.cpp

1318       // updated value. To this end, we iterate all call sites, check if they
3250   // SCCs.To detect if there's a cycle, we only need to find the maximal ones.
3378   const ToTy *To = nullptr;
3392                detail::combineHashValue(PairDMI ::getHashValue({From, To}),
3396   ReachabilityQueryInfo(const Instruction *From, const ToTy *To)
3397       : From(From), To(To) {}
3401   ReachabilityQueryInfo(Attributor &A, const Instruction &From, const ToTy &To,
3403       : From(&From), To(&To), ExclusionSet(ES) {
3413       : From(RQI.From), To(RQI.To), ExclusionSet(RQI.ExclusionSet) {}
3433     if (!PairDMI::isEqual({LHS->From, LHS->To}, {RHS->From, RHS->To}))
3497       RQITy PlainRQI(RQI.From, RQI.To);
3499         RQITy *RQIPtr = new (A.Allocator) RQITy(RQI.From, RQI.To);
3511           RQITy(A, *RQI.From, *RQI.To, RQI.ExclusionSet, true);
3539       RQITy PlainRQI(StackRQI.From, StackRQI.To);
3574       Attributor &A, const Instruction &From, const Instruction &To,
3577     if (&From == &To)
3580     RQITy StackRQI(A, From, To, ExclusionSet, false);
3614     auto WillReachInBlock = [&](const Instruction &From, const Instruction &To,
3617       while (IP && IP != &To) {
3624       return IP == &To;
3628     const BasicBlock *ToBB = RQI.To->getParent();
3635         WillReachInBlock(*RQI.From, *RQI.To, RQI.ExclusionSet))
3641     if (!WillReachInBlock(ToBB->front(), *RQI.To, RQI.ExclusionSet))
4539   bool isEdgeDead(const BasicBlock *From, const BasicBlock *To) const override {
4541            To->getParent() == getAnchorScope() &&
4543     return isValidState() && !AssumedLiveEdges.count(std::make_pair(From, To));
4857   // To be in this state we have to (1) finished the exploration and (3) not
6535 /// ----------------------- Heap-To-Stack Conversion ---------------------------
6605       // To do heap to stack, we need to know that the allocation itself is
8565       // on the call edge, though, we should. To make that happen we need to
10628       Attributor &A, const Instruction &From, const Function &To,
10633     RQITy StackRQI(A, From, To, ExclusionSet, false);
10646         !instructionCanReach(A, *EntryI, *RQI.To, nullptr))
10655       // TODO Check To backwards in this case.
10660         if (Fn == RQI.To)
10666           // TODO Check To backwards in this case.
10682             InterFnReachability->instructionCanReach(A, FnFirstInst, *RQI.To,
11335       // Check if we should process the current value. To prevent endless