Lines Matching full:become

105 // As a loop is peeled, it may be the case that Phi nodes become
122 // become known.  The IR for this loop looks something like the following:
136 // The arguments for the calls to g will become known after 3 iterations
137 // of the loop, because the phi nodes values become known after 3 iterations
162   // such that phi instructions become determined (subject to allowable limits)
272 // Try to find any invariant memory reads that will become dereferenceable in
294   // be dereferenceable. If there are such loads and no writes, they will become
355   // return true if inversed condition become known before reaching the
435     // iteration. See if that makes !Pred become unknown again.
514 /// improvement inside that API from causing peeling to become more aggressive.
590   // Here we try to get rid of Phis which become invariants after 1, 2, ..., N
592   // which every Phi is guaranteed to become an invariant, and try to peel the