Lines Matching +full:everything +full:- +full:else

1 //===- PhiValues.cpp - Phi Value Analysis ---------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
17   PV->invalidateValue(getValPtr());  in deleted()
23   PV->invalidateValue(getValPtr());  in allUsesReplacedWith()
33 // The goal here is to find all of the non-phi values reachable from this phi,
39 //    non-phi values. The SCC may not be the maximal subgraph for that set of
42 //  * Tarjan's algorithm completes components in a bottom-up manner, i.e. it
45 //    everything we need to collect the values reachable from that component.
46 //  * We collect both the non-phi values reachable from each SCC, as that's what
59   for (Value *PhiOp : Phi->incoming_values()) {  in processPhi()
72     } else {  in processPhi()
91       for (Value *Op : ComponentPhi->incoming_values()) {  in processPhi()
101               Reachable.insert(It->second.begin(), It->second.end());  in processPhi()
103         } else  in processPhi()
117     // Filter out phis to get the non-phi reachable values.  in processPhi()
175       else if (It->second.empty())  in print()
177       else  in print()
178         for (Value *V : It->second)  in print()
180           // handle instructions and everything else slightly differently in  in print()
184           else  in print()
216   Result->releaseMemory();  in releaseMemory()
225 INITIALIZE_PASS(PhiValuesWrapperPass, "phi-values", "Phi Values Analysis", false,