Searched defs:phi (Results 1 - 25 of 76) sorted by path

1234

/external/chromium_org/cc/animation/
H A Dtransform_operation.cc212 double phi = atan2(px, py); local
214 candidates[0] = phi;
/external/chromium_org/third_party/WebKit/Source/platform/transforms/
H A DTransformOperations.cpp116 double phi = atan2(px, py); local
119 candidates[0] = phi; // The element at 0deg (maximum x)
/external/chromium_org/third_party/WebKit/Source/wtf/text/
H A DWTFStringTest.cpp107 const double phi = 1.6180339887498948482; local
108 testNumberToStringECMAScript(phi, "1.618033988749895");
/external/chromium_org/third_party/freetype/src/base/
H A Dftstroke.c983 FT_Angle phi, theta, rotate; local
1021 phi = stroker->angle_in + theta;
1027 FT_Vector_From_Polar( &delta, length, phi + rotate );
1055 FT_Angle theta = 0, phi = 0; local
1075 phi = stroker->angle_in;
1080 phi = stroker->angle_in + theta + rotate;
1124 phi );
1132 FT_Vector_From_Polar( &delta, length, phi + rotate );
1141 FT_Vector_From_Polar( &delta, length, phi - rotate );
1172 FT_Vector_From_Polar( &delta, length, phi );
1433 FT_Angle theta, phi, rotate, alpha0 = 0; local
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_peephole.cpp90 // the sources stem from a phi, in which case we don't want to mess up potential
91 // swaps $rX <-> $rY, i.e. do not create live range overlaps of phi src and def.
2130 Instruction *phi, *next, *ik; local
2135 for (phi = bb->getPhi(); phi && phi->op == OP_PHI; phi = next) {
2136 next = phi->next;
2137 if (phi->getSrc(0)->refCount() > 1)
2139 ik = phi
[all...]
H A Dnv50_ir_ra.cpp331 // These MOVs are also crucial in making sure the live intervals of phi srces
337 Instruction *phi, *mov; local
362 // insert MOVs (phi->src(j) should stem from j-th in-BB)
369 for (phi = bb->getPhi(); phi && phi->op == OP_PHI; phi = phi->next) {
372 mov->setSrc(0, phi->getSrc(j));
373 mov->setDef(0, new_LValue(func, phi
[all...]
H A Dnv50_ir_ssa.cpp350 // TODO: don't add phi functions for values that aren't used outside
366 // for each block in workList, insert a phi for lval in the block's
373 Instruction *phi; local
380 // pruned SSA: don't need a phi if the value is not live-in
384 phi = new_Instruction(this, OP_PHI, typeOfSize(lval->reg.size));
385 dfBB->insertTail(phi);
387 phi->setDef(0, lval);
389 phi->setSrc(s, lval);
489 Instruction *phi; local
501 for (phi
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/svga/include/
H A Dsvga3d_reg.h1293 float phi; member in struct:__anon14001
/external/chromium_org/v8/src/arm/
H A Dlithium-arm.cc782 HPhi* phi = block->phis()->at(i); local
783 if (phi->HasMergedIndex()) {
784 last_environment->SetValueAt(phi->merged_index(), phi);
/external/chromium_org/v8/src/arm64/
H A Dlithium-arm64.cc619 HPhi* phi = block->phis()->at(i); local
620 if (phi->HasMergedIndex()) {
621 last_environment->SetValueAt(phi->merged_index(), phi);
/external/chromium_org/v8/src/compiler/
H A Dchange-lowering-unittest.cc131 Node* phi = reduction.replacement(); local
133 EXPECT_THAT(phi,
202 Node* phi = reduction.replacement(); local
205 phi,
232 Node* phi = reduction.replacement(); local
235 phi,
261 Node* phi = reduction.replacement(); local
264 phi,
287 Node* phi = reduction.replacement(); local
290 phi,
313 Node* phi = reduction.replacement(); local
369 Node* phi = reduction.replacement(); local
398 Node* phi = reduction.replacement(); local
425 Node* phi = reduction.replacement(); local
452 Node* phi = reduction.replacement(); local
[all...]
H A Dchange-lowering.cc114 Node* phi = graph()->NewNode( local
118 return Replace(phi);
154 Node* phi = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), heap_number, local
157 return Replace(phi);
180 Node* phi = graph()->NewNode( local
184 return Replace(phi);
204 Node* phi = local
207 return Replace(phi);
232 Node* phi = graph()->NewNode(common()->Phi(kMachAnyTagged, 2), smi, local
235 return Replace(phi);
[all...]
H A Dgraph-builder.cc156 Node* phi = builder_->NewPhi(1, values()->at(i), control); local
157 values()->at(i) = phi;
H A Dinstruction-selector-unittest.cc228 Node* phi = m.Phi(type, param0, param1); local
229 m.Return(phi);
231 EXPECT_EQ(s.IsDouble(phi->id()), s.IsDouble(param0->id()));
232 EXPECT_EQ(s.IsDouble(phi->id()), s.IsDouble(param1->id()));
248 Node* phi = m.Phi(type, param0, param1); local
249 m.Return(phi);
251 EXPECT_EQ(s.IsReference(phi->id()), s.IsReference(param0->id()));
252 EXPECT_EQ(s.IsReference(phi->id()), s.IsReference(param1->id()));
H A Dinstruction-selector.cc39 Node* phi = *j; local
40 if (phi->opcode() != IrOpcode::kPhi) continue;
43 Node::Inputs inputs = phi->inputs();
H A Dinstruction.cc447 Node* phi = *j; local
448 if (phi->opcode() != IrOpcode::kPhi) continue;
449 os << " phi: v" << phi->id() << " =";
450 Node::Inputs inputs = phi->inputs();
H A Djs-inlining.cc152 Node* phi = local
157 graph->NewNode(jsgraph->common()->Return(), phi, ephi, final_merge);
H A Djs-typed-lowering.cc613 Node* phi = graph()->NewNode(common()->EffectPhi(2), store, local
616 return ReplaceWith(phi);
H A Dregister-allocator.cc542 // All phi input operands corresponding to this successor edge are live
549 Node* phi = *j; local
550 if (phi->opcode() != IrOpcode::kPhi) continue;
551 Node* input = phi->InputAt(index);
1066 Node* phi = *i; local
1067 if (phi->opcode() != IrOpcode::kPhi) continue;
1071 phi_operand->set_virtual_register(phi->id());
1074 Node::Inputs inputs = phi->inputs();
1094 LiveRange* live_range = LiveRangeFor(phi->id());
1100 // We use the phi
1299 Node* phi = *i; local
[all...]
H A Dverifier.cc420 Node* phi = *i; local
421 if (phi->opcode() != IrOpcode::kPhi) continue;
424 if (phi->InputCount() >
425 OperatorProperties::GetValueInputCount(phi->op())) {
426 Node* control = NodeProperties::GetControlInput(phi);
/external/chromium_org/v8/src/
H A Dhydrogen-bch.cc48 HLoopInformation* loop = data->phi()->block()->current_loop();
100 loop_header_ = data->phi()->block()->current_loop()->loop_header();
195 data->phi()->block()->current_loop()->loop_header();
285 HPhi* phi = bb->phis()->at(i); local
286 phi->DetectInductionVariable();
303 HPhi* phi = HPhi::cast(decomposition.base); local
305 if (!phi->IsInductionVariable()) continue;
306 InductionVariableData* data = phi->induction_variable_data();
320 if (!phi->IsLimitedInductionVariable()) continue;
324 phi
339 HPhi* phi = bb->phis()->at(i); local
[all...]
H A Dhydrogen-check-elimination.cc204 HPhi* phi = succ->phis()->at(phi_index); local
205 HValue* phi_operand = phi->OperandAt(pred_index);
209 // Create an entry for a phi in the table.
210 copy->Insert(phi, NULL, pred_entry->maps_, pred_entry->state_);
324 HPhi* phi = HPhi::cast(this_entry->object_); local
325 HValue* phi_operand = phi->OperandAt(pred_index);
739 entry->object_->IsPhi() ? "phi" : "object", entry->object_->id());
H A Dhydrogen-dce.cc57 HPhi* phi = block->phis()->at(j); local
58 if (phi->CannotBeEliminated()) MarkLive(phi, &worklist);
84 HPhi* phi = block->phis()->at(j); local
85 if (!phi->CheckFlag(HValue::kIsLive)) {
86 worklist.Add(phi, zone());
88 phi->ClearFlag(HValue::kIsLive);
93 // Process phis separately to avoid simultaneously mutating the phi list.
95 HPhi* phi = worklist.RemoveLast(); local
96 HBasicBlock* block = phi
[all...]
H A Dhydrogen-escape-analysis.cc92 HPhi* phi = NewPhiAndInsert(block, operand, index); local
93 state->SetOperandAt(index, phi);
112 // Insert a newly created phi into the given block and fill all incoming
118 HPhi* phi = new(zone) HPhi(HPhi::kInvalidMergedIndex, zone); local
120 phi->AddInput(incoming_value);
122 block->AddPhi(phi);
123 return phi;
275 HPhi* phi = HPhi::cast(succ_operand); local
276 phi->SetOperandAt(succ->PredecessorIndexOf(block), operand);
279 HPhi* phi local
[all...]
H A Dhydrogen-infer-representation.cc20 // (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); local
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); local
111 if (index != i) phi
142 HPhi* phi = phis->at(j); local
[all...]

Completed in 468 milliseconds

1234