Searched defs:inputs (Results 1 - 6 of 6) sorted by relevance
/openjdk7/jdk/src/share/classes/sun/tools/jconsole/inspector/ |
H A D | OperationEntry.java | 36 private XTextField inputs[]; field in class:OperationEntry 54 inputs = new XTextField[params.length]; 70 add(inputs[i] = 77 inputs[i].setHorizontalAlignment(SwingConstants.CENTER); 106 return Utils.getParameters(inputs,signature);
|
H A D | Utils.java | 367 * This method is responsible for converting the inputs given by the user 370 public static Object[] getParameters(XTextField[] inputs, String[] params) argument 372 Object result[] = new Object[inputs.length]; 374 for (int i = 0; i < inputs.length; i++) { 375 userInput = inputs[i].getValue();
|
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/ |
H A D | InputBlock.java | 46 private Set<InputBlockEdge> inputs; field in class:InputBlock 56 inputs = new HashSet<InputBlockEdge>(); 67 assert b.inputs.contains(e); 68 b.inputs.remove(e); 105 return Collections.unmodifiableSet(inputs); 132 b.inputs.add(e);
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | lcm.cpp | 407 // routine). If there is a tie, choose the instruction with the most inputs. 501 uint n_score = n->req(); // Many inputs get high score to break ties 553 // Set next-call for all inputs to this call 699 // Count block-local inputs to 'n' 934 Node_Array inputs = new Node_List(Thread::current()->resource_area()); local 936 inputs.map(k, catch_cleanup_find_cloned_def(bbs[use_blk->pred(k)->_idx], def, def_blk, bbs, n_clone_idx)); 946 if (phi->in(k) != inputs[k]) { 960 new_phi->set_req(k, inputs[k]);
|
H A D | parse1.cpp | 366 // Build an uncommon trap here, if any inputs can be unexpected. 1400 int inputs, depth; local 1401 bool have_se = !stopped() && compute_stack_effects(inputs, depth); 1402 assert(!have_se || pre_bc_sp >= inputs, err_msg_res("have enough stack to execute this BC: pre_bc_sp=%d, inputs=%d", pre_bc_sp, inputs)); 1511 // Make a region if we know there are multiple or unpredictable inputs. 1514 if (pnum > PhiNode::Input // Known multiple inputs. 1515 || target->is_handler() // These have unpredictable inputs. 1516 || target->is_loop_head() // Known multiple inputs [all...] |
H A D | graphKit.cpp | 380 // get a copy of the base memory, and patch some inputs into it 854 int inputs = 0, depth = 0; local 857 if (compute_stack_effects(inputs, depth)) { 859 stack_slots_not_pruned = inputs; 987 bool GraphKit::compute_stack_effects(int& inputs, int& depth) { argument 1010 inputs = 0; 1013 case Bytecodes::_dup: inputs = 1; break; 1014 case Bytecodes::_dup_x1: inputs = 2; break; 1015 case Bytecodes::_dup_x2: inputs = 3; break; 1016 case Bytecodes::_dup2: inputs 1893 int inputs, ignored_depth; local [all...] |
Completed in 51 milliseconds