Searched refs:Phi (Results 1 - 18 of 18) sorted by relevance
/openjdk7/hotspot/src/share/vm/c1/ |
H A D | c1_Canonicalizer.hpp | 60 virtual void do_Phi (Phi* x);
|
H A D | c1_InstructionPrinter.hpp | 88 virtual void do_Phi (Phi* x);
|
H A D | c1_ValueStack.cpp | 180 Value phi = new Phi(t, b, -index - 1); 190 Value phi = new Phi(t, b, index);
|
H A D | c1_ValueStack.hpp | 319 Phi* v_phi = value->as_Phi(); \ 327 Phi* v_phi = value->as_Phi(); \
|
H A D | c1_InstructionPrinter.cpp | 109 Phi* phi = v ? v->as_Phi() : NULL; 118 Phi* phi = v ? v->as_Phi() : NULL; 226 Phi* phi = value->as_Phi(); 288 Phi* phi = v->as_Phi(); 347 void InstructionPrinter::do_Phi(Phi* x) {
|
H A D | c1_Instruction.cpp | 834 Phi* existing_phi = existing_value->as_Phi(); 845 Phi* existing_phi = existing_value->as_Phi(); 953 // Implementation of Phi 959 Value Phi::operand_at(int i) const { 976 int Phi::operand_count() const {
|
H A D | c1_ValueMap.hpp | 163 void do_Phi (Phi* x) { /* nothing to do */ }
|
H A D | c1_Optimizer.cpp | 486 void do_Phi (Phi* x); 654 void handle_Phi (Phi* x); 667 void NullCheckVisitor::do_Phi (Phi* x) { nce()->handle_Phi(x); } 1104 void NullCheckEliminator::handle_Phi(Phi* x) { 1119 // Value is non-null => update Phi 1121 tty->print_cr("Eliminated Phi %d's null check for phifun because all inputs are non-null", x->id());
|
H A D | c1_Instruction.hpp | 49 class Phi; 163 virtual void do_Phi (Phi* x) = 0; 462 virtual Phi* as_Phi() { return NULL; } 567 // A Phi is a phi function in the sense of SSA form. It stands for 569 // A Phi consists of n operands, one for every incoming branch. 571 LEAF(Phi, Instruction) 578 Phi(ValueType* type, BlockBegin* b, int index) function
|
H A D | c1_GraphBuilder.cpp | 2336 Phi* phi = v->as_Phi(); 2344 } else if (phi->is_set(Phi::cannot_simplify)) { 2347 } else if (phi->is_set(Phi::visited)) { 2356 phi->set(Phi::visited); 2368 phi->clear(Phi::visited); 2380 phi->set(Phi::cannot_simplify); 2381 phi->clear(Phi::visited); 2390 phi->clear(Phi::visited); 2416 Phi* phi = value->as_Phi(); 2423 // It eliminates all Phi function [all...] |
H A D | c1_LIRGenerator.cpp | 728 static ciType* phi_declared_type(Phi* phi) { 754 Phi* phi; 978 // Phi technique: 989 // area. Every Phi has an index which designates its spill slot 997 Phi* phi = sux_val->as_Phi(); 1138 void LIRGenerator::do_Phi(Phi* x) { 1328 assert(x->as_Phi() || x->as_Local() != NULL, "only for Phi and Local");
|
H A D | c1_LIRGenerator.hpp | 379 // one isn't already allocated. Only for Phi and Local. 463 // for virtual registers, maps them back to Phi's or Local's 487 virtual void do_Phi (Phi* x);
|
H A D | c1_LinearScan.hpp | 328 void resolve_exception_edge(XHandler* handler, int throwing_op_id, int reg_num, Phi* phi, MoveResolver &move_resolver);
|
H A D | c1_Canonicalizer.cpp | 185 void Canonicalizer::do_Phi (Phi* x) {}
|
H A D | c1_LinearScan.cpp | 589 // Phi functions at the begin of an exception handler are 1893 void LinearScan::resolve_exception_edge(XHandler* handler, int throwing_op_id, int reg_num, Phi* phi, MoveResolver &move_resolver) { 5064 // Intervals resulting from Phi-Functions have more than one definition (marked
|
/openjdk7/jdk/src/share/native/sun/security/ec/impl/ |
H A D | mpi.c | 3897 #define MP_MUL_DxD(a, b, Phi, Plo) \ 3900 Phi = (mp_digit)(product >> MP_DIGIT_BIT); } 3902 #define MP_MUL_DxD(a, b, Phi, Plo) \ 3904 Phi = asm ("umulh %a0, %a1, %v0", a, b); } 3906 #define MP_MUL_DxD(a, b, Phi, Plo) \ 3909 Phi = (a >> MP_HALF_DIGIT_BIT) * (b >> MP_HALF_DIGIT_BIT); \ 3913 Phi += a1b0 >> MP_HALF_DIGIT_BIT; \ 3915 Phi += MP_HALF_RADIX; \ 3919 ++Phi; \ 4040 #define MP_SQR_D(a, Phi, Pl [all...] |
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | classes.hpp | 200 macro(Phi)
|
H A D | node.hpp | 585 DEFINE_CLASS_ID(Phi, Type, 0) 753 DEFINE_CLASS_QUERY(Phi)
|
Completed in 360 milliseconds