Lines Matching full:phi
20 // (1) Initialize bit vectors and count real uses. Each phi gets a
33 // phi is connected to another phi if its value is used either directly or
41 HPhi* phi = phi_list->at(i);
42 for (HUseIterator it(phi->uses()); !it.Done(); it.Advance()) {
96 // Simplify constant phi inputs where possible.
102 // Use the phi reachability information from step 2 to
103 // sum up the non-phi use counts of all connected phis.
105 HPhi* phi = phi_list->at(i);
111 if (index != i) phi->AddNonPhiUsesFrom(it_use); // Don't count twice.
142 HPhi* phi = phis->at(j);
143 if (phi->representation().IsNone()) {
144 phi->ChangeRepresentation(Representation::Tagged());
