Lines Matching defs:phi
43 // (1) Initialize bit vectors and count real uses. Each phi gets a
56 // phi is connected to another phi if its value is used either directly or
64 HPhi* phi = phi_list->at(i);
65 for (HUseIterator it(phi->uses()); !it.Done(); it.Advance()) {
107 // Simplify constant phi inputs where possible.
113 // Use the phi reachability information from step 2 to
114 // sum up the non-phi use counts of all connected phis.
116 HPhi* phi = phi_list->at(i);
122 if (index != i) phi->AddNonPhiUsesFrom(it_use); // Don't count twice.
153 HPhi* phi = phis->at(j);
154 if (phi->representation().IsNone()) {
155 phi->ChangeRepresentation(Representation::Tagged());
