Searched refs:phi1 (Results 1 - 9 of 9) sorted by relevance

/external/v8/test/mjsunit/regress/
H A Dregress-crbug-173907.js42 var phi1 = v + K;
45 spill(); // At this point initial values for phi1 and phi2 are spilled.
56 // All registers are blocked and phis for phi1 and phi2 are spilled because
67 // Now swap values of phi1 and phi2 to create cycle between phis.
68 var t = phi1;
69 phi1 = phi2;
73 // Now we want to get values of phi1 and phi2. However we would like to
74 // do it in a way that does not produce any uses of phi1&phi2 that have
76 result[0] = (O === 0) ? phi1 : phi2;
77 result[1] = (O !== 0) ? phi1
[all...]
H A Dregress-crbug-173907b.js42 var phi1 = v + K;
45 spill(); // At this point initial values for phi1 and phi2 are spilled.
56 // All registers are blocked and phis for phi1 and phi2 are spilled because
67 // Now swap values of phi1 and phi2 to create cycle between phis.
68 var t = phi1;
69 phi1 = phi2;
73 // Now we want to get values of phi1 and phi2. However we would like to
74 // do it in a way that does not produce any uses of phi1&phi2 that have
76 result[0] = (O === 0) ? phi1 : phi2;
77 result[1] = (O !== 0) ? phi1
[all...]
/external/v8/test/cctest/compiler/
H A Dtest-loop-analysis.cc728 Node* phi1 = t.graph.NewNode( local
730 Node* cond1 = t.graph.NewNode(&kIntAdd, phi1, t.one);
746 Node* ret = t.graph.NewNode(t.common.Return(), phi1, t.start, exit1);
749 Node* choices[] = {p1, phi1, cond1, phi2, cond2};
754 Node* header1[] = {loop1, phi1};
804 Node* phi1 = t.graph.NewNode(t.common.Phi(MachineRepresentation::kWord32, 2), local
806 Node* cond1 = t.graph.NewNode(&kIntAdd, phi1, p1b);
833 Node* ret = t.graph.NewNode(t.common.Return(), phi1, t.start, exit1);
839 Node* o2[] = {t.one, phi1, cond1};
840 Node* o3[] = {t.one, phi1, cond
[all...]
/external/v8/test/unittests/compiler/
H A Dbranch-elimination-unittest.cc133 Node* phi1 = local
146 Node* add = graph()->NewNode(machine()->Int32Add(), phi1, phi2);
H A Dscheduler-unittest.cc242 Node* phi1 = graph()->NewNode( local
248 fv, phi1, m);
362 Node* phi1 = graph()->NewNode( local
366 ind->ReplaceInput(1, phi1); // close induction variable.
392 Node* phi1 = graph()->NewNode( local
395 Node* add = graph()->NewNode(&kIntAdd, ind, phi1);
441 Node* phi1 = graph()->NewNode( local
444 Node* add = graph()->NewNode(&kIntAdd, ind, phi1);
/external/opencv/cv/src/
H A Dcvhough.cpp293 float phi, phi1; local
316 for( ti1 = 1, phi = theta_it - halfPi, phi1 = (theta_it + t) * itheta;
317 ti1 < halftn; ti1++, phi += theta_it, phi1 += scale_factor )
321 i += cvFloor( phi1 );
/external/freetype/src/base/
H A Dftstroke.c1665 FT_Angle theta1, phi1, theta2, phi2, rotate, alpha0 = 0; local
1673 phi1 = ft_angle_mean( angle_in, angle_mid );
1689 FT_Vector_From_Polar( &ctrl1, length1, phi1 + rotate );
/external/pdfium/third_party/freetype/src/base/
H A Dftstroke.c1664 FT_Angle theta1, phi1, theta2, phi2, rotate, alpha0 = 0; local
1672 phi1 = ft_angle_mean( angle_in, angle_mid );
1688 FT_Vector_From_Polar( &ctrl1, length1, phi1 + rotate );
/external/v8/src/compiler/
H A Dwasm-compiler.cc2176 Node* phi1 = graph()->NewNode(phi_op, vtrue1, vfalse1, merge1); local
2179 NodeProperties::ReplaceUses(value, phi1, ephi1, etrue1, etrue1);
2189 return phi1;

Completed in 391 milliseconds