/openjdk7/hotspot/src/share/vm/opto/ |
H A D | postaloc.cpp | 60 return true; // Direct use of callee-save proj 264 // then it should use the current reaching def instead. 304 Node* use = x->fast_out(i); i++; local 305 if (use != first) ignore_self = false; 321 OptoReg::is_reg(reg) || // turning into a register use OR 322 regnd[reg]->outcnt()==1 ) { // last use of a spill-load turns into a CISC use 361 Node* use = n->fast_out(i); local 362 if (use->is_Proj() && use [all...] |
H A D | loopPredicate.cpp | 212 Node* use = rgn->fast_out(i); local 213 if (use->is_Phi() && use->outcnt() > 0) { 214 assert(use->in(0) == rgn, ""); 215 _igvn.rehash_node_delayed(use); 216 use->add_req(use->in(proj_index)); 284 Node* use = rgn->fast_out(i); local 285 if (use->is_Phi() && use 464 visit(Node* use, Node* n) argument [all...] |
H A D | machnode.cpp | 257 // There is not a unique memory use here. We will fall to AliasIdxBot. 292 // Add the offset determined by the "base", or use Type::OffsetBot. 533 // Else use generic type from ideal register set 588 // Values in the domain use the users calling convention, embodied in the 628 Node *use = fast_out(i); local 629 if (!use->is_Proj()) continue; 630 if (use->as_Proj()->_con == TypeFunc::Parms) { 640 // Values in the domain use the users calling convention, embodied in the 667 // Values in the domain use the users calling convention, embodied in the 672 // If this call is a MethodHandle invoke we have to use [all...] |
H A D | reg_split.cpp | 42 // point between LRP and HRP. Uses in the HRP region will use the spilled 45 // will use that new Def until another HRP region is encountered. Defs in 66 // not cover the input (or output), use the input (or output) mask instead. 67 Node *PhaseChaitin::get_spillcopy_wide( Node *def, Node *use, uint uidx ) { argument 82 const RegMask *o_mask = use ? &use->in_RegMask(uidx) : w_mask; 89 ((num_regs == 1) // Single use or aligned 98 // Does the ideal-reg-mask overlap with o_mask? I.e., can I use 160 // (The implicit_null_check function ensures the use is also dominated 192 uint PhaseChaitin::split_USE( Node *def, Block *b, Node *use, uin argument 1199 Node *use = n->in(copyidx); local [all...] |
H A D | subnode.cpp | 71 // This folding through an O2 removes a loop-exit use of a loop-varying 511 return TypeInt::CC; // else use worst case results 544 // We can use ranges of the form [lo..hi] if signs are the same. 570 return TypeInt::CC; // else use worst case results 618 return TypeInt::CC; // else use worst case results 768 // // ... use a ... 1236 // // checking the trip counter and they want to use the post-incremented 1237 // // counter. If they use the PRE-incremented counter, then the counter has 1293 Node* use = fast_out(i); local 1294 if (use [all...] |
H A D | escape.hpp | 220 PointsToNode* use(int e) const { return _uses.at(e); } function in class:PointsToNode 221 bool add_use(PointsToNode* use) { return _uses.append_if_missing(use); } argument 223 // Mark base edge use to distinguish from stored value edge. 224 bool add_base_use(FieldNode* use) { return _uses.append_if_missing((PointsToNode*)((intptr_t)use + 1)); } argument 225 static bool is_base_use(PointsToNode* use) { return (((intptr_t)use) & 1); } argument 226 static PointsToNode* get_use_node(PointsToNode* use) { return (PointsToNode*)(((intptr_t)use) argument [all...] |
H A D | lcm.cpp | 277 // mach use (faulting) trying to hoist 379 // Remove the existing null check; use a new implicit null check instead. 380 // Since schedule-local needs precise def-use info, we need to correct 400 // one choice, then use it. Projections take top priority for correctness 410 // If only a single entry on the stack, use it 460 // See if any use is a branch 464 Node* use = n->fast_out(j); local 466 // The use is a conditional branch, make them adjacent 467 if (use->is_MachIf() && cfg->_bbs[use 895 catch_cleanup_fix_all_inputs(Node *use, Node *old_def, Node *new_def) argument 976 catch_cleanup_intra_block(Node *use, Node *def, Block *blk, int beg, int n_clone_idx) argument 998 catch_cleanup_inter_block(Node *use, Block *use_blk, Node *def, Block *def_blk, Block_Array &bbs, int n_clone_idx) argument 1049 Node *use = out->pop(); local [all...] |
H A D | phaseX.cpp | 373 // Instead, be sure we never again use the source table. 613 x = k; // use existing constant 684 assert( i->_idx >= k->_idx, "Idealize should return new nodes, use Identity to return old nodes" ); 697 // use the cached Value instead of suffering with 'bottom_type'. 792 // roots during def-use info creation; hence they represent an invisible 793 // use. Clear them out. 998 // Register a new node with the optimizer. Update the types array, the def-use 1049 // Switched input to left side because this is the only use 1069 assert((i->_idx >= k->_idx) || i->is_top(), "Idealize should return new nodes, use Identity to return old nodes"); 1074 // Make users of old Node now use ne 1258 Node* use = old->last_out(i); // for each use... local 1309 Node* use = n->fast_out(i); // Get use local 1756 Node* use = last_out(i); local [all...] |
H A D | callnode.cpp | 697 Node *use = p->fast_out(i); local 698 if (use->is_CheckCastPP()) { 702 cast = use;
|
H A D | cfgnode.cpp | 136 // Check that only one use is a Phi 324 // Skip if only one use is an other Phi or Call or Uncommon trap. 632 // Check that only one use is a Phi and that it simplifies to two constants + 783 Node* use = region->fast_out(k); local 784 if( use->is_Phi()) { 785 PhiNode *phi2 = use->as_Phi(); 889 // This means we have to use type_or_null to defend against untyped regions. 1598 // This means we have to use type_or_null to defend against untyped regions. 1765 // If they have a base, use that it.
|
H A D | escape.cpp | 262 // Now use the escape information to create unique types for 1214 PointsToNode* use = i.get(); local 1215 if (use->is_Arraycopy()) 1217 add_uses_to_worklist(use); 1218 if (use->is_Field() && use->as_Field()->is_oop()) { 1221 add_field_uses_to_worklist(use->as_Field()); 1226 PointsToNode* use = _worklist.pop(); local 1227 if (PointsToNode::is_base_use(use)) { 1229 use 1530 PointsToNode* use = i.get(); local 2438 Node* use = n->fast_out(i); local 2755 Node *use = n->fast_out(i); local 2798 Node* use = tgt->ideal_node(); local 2817 Node *use = raw_result->fast_out(i); local 2899 Node *use = n->fast_out(i); local 2987 Node *use = n->fast_out(i); local 2998 Node *use = n->fast_out(i); local 3248 PointsToNode* use = j.get(); local [all...] |
H A D | gcm.cpp | 76 Node* use = n->fast_out(i); local 77 if (use->is_Proj()) { 78 Block* buse = _bbs[use->_idx]; 81 buse->find_remove(use); // Remove from wrong block 82 _bbs.map(use->_idx, b); // Re-insert in this block 83 b->add_inst(use); 90 // Nodes that have is_block_proj() nodes as their control need to use 224 // to root and nodes that use is_block_proj() nodes should be attached 312 // We are placing a definition, and have been given a def->use edge. 313 // The definition must dominate the use, s 316 raise_LCA_above_use(Block* LCA, Node* use, Node* def, Block_Array &bbs) argument 816 Node *use = n->is_Proj() ? n->in(0) : n; local 932 latency_from_use(Node *n, const Node *def, Node *use) argument 1176 Node* use = self->fast_out(i); local [all...] |
H A D | loopopts.cpp | 69 // Alter data node to use pre-phi inputs 144 // the existing Node picks up a new use. We need to make the 162 // New late point must dominate new use 171 // for each use outside of this loop. 217 set_ctrl(con, C->root()); // Constant gets a new use 552 Node* use = phi->fast_out(k); local 553 if (use->is_Cmp() || use->is_DecodeN() || use->is_EncodeP()) 555 // Is there a use insid 1039 Node* use = n->raw_out(i); local 1217 sink_use( Node *use, Node *post_loop ) argument 1314 Node *use = worklist.pop(); local 1383 Node *use = worklist.pop(); local 1596 Node* use = n->fast_out(i); local 1879 Node* use = n->raw_out(idx); local 1904 Node* use = n->fast_out(j); local 1918 Node* use = n->fast_out(j); local 1933 Node* use = n->fast_out(j); local 1939 Node *use = worklist.pop(); local 1985 Node* use = n->fast_out(j); local 2006 Node *use = worklist.pop(); local 2020 insert_phi_for_loop( Node* use, uint idx, Node* lp_entry_val, Node* back_edge_val, LoopNode* lp ) argument 2081 is_valid_clone_loop_exit_use( IdealLoopTree *loop, Node* use, uint exit_idx) argument 2100 Node *use = def->fast_out(j); local 2440 Node* use = n->fast_out(j); local 2475 Node* use = head->fast_out(j); local 2590 Node *use = def->fast_out(j); local 2598 Node *use = worklist.pop(); local 2669 Node* use = head->fast_out(k); local 2737 Node* use = phi->fast_out(i); // User of trip-counter local [all...] |
H A D | node.cpp | 105 // that same edge. On this point we must use the Honor System. 226 assert((int)n > 0, "use imax -= n only with a positive count"); 296 assert(Compile::current() == C, "must use operator new(Compile*)"); 350 assert( is_not_dead(n0), "can not use dead node"); 362 assert( is_not_dead(n0), "can not use dead node"); 363 assert( is_not_dead(n1), "can not use dead node"); 376 assert( is_not_dead(n0), "can not use dead node"); 377 assert( is_not_dead(n1), "can not use dead node"); 378 assert( is_not_dead(n2), "can not use dead node"); 392 assert( is_not_dead(n0), "can not use dea 1236 Node* use = dead->last_out(k); local 1969 Node* use = def->fast_out(i); local 1994 Node* use = raw_out(i); local [all...] |
H A D | stringopts.cpp | 87 CallStaticJavaNode *use = i.get()->isa_CallStaticJava(); 88 if (use != NULL && use->method() != NULL && 89 use->method()->intrinsic_id() == vmIntrinsics::_String_String && 90 use->in(TypeFunc::Parms + 1) == endprojs.resproj) { 93 sc->set_string_alloc(use->in(TypeFunc::Parms)); 94 sc->set_end(use); 233 // the code to be thrown out we could still recompile and use the 332 Node *use = i.get(); local 333 int opc = use 455 CallStaticJavaNode *use = i.get()->isa_CallStaticJava(); local 667 Node* use = dead_worklist.pop(); local 902 Node *use = i.get(); local [all...] |
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/tools/internal/xjc/model/nav/ |
H A D | NavigatorImpl.java | 148 public NType use(NClass nc) { method in class:NavigatorImpl
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/tools/internal/xjc/reader/xmlschema/bindinfo/ |
H A D | BIProperty.java | 90 * use and an attribute decl, then anything unspecified in the 91 * attribute use defaults to attribute decl. 266 * <b>if an attribute use carries a fixed value.</b> 300 public CAttributePropertyInfo createAttributeProperty( XSAttributeUse use, TypeUse tu ) { argument 303 getCustomization(use).isConstantProperty() && 304 use.getFixedValue()!=null; 310 name = conv.toConstantName(use.getDecl().getName()); 312 name = conv.toPropertyName(use.getDecl().getName()); 320 return wrapUp(new CAttributePropertyInfo(name,use,getCustomizations(use),us [all...] |
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/bind/v2/model/nav/ |
H A D | Navigator.java | 90 * The use of {@code baseType} in {@code type}. 205 T use(C c); method in interface:Navigator 208 * If the given type is an use of class declaration,
|
H A D | ReflectionNavigator.java | 329 public Class use(Class c) { method in class:ReflectionNavigator
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/tools/internal/jxc/model/nav/ |
H A D | APTNavigator.java | 136 // use that as a key to sort them correctly. This isn't "correct" in 229 public TypeMirror use(TypeDeclaration t) { method in class:APTNavigator
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/tools/internal/ws/processor/modeler/annotation/ |
H A D | WebServiceVisitor.java | 259 if (soapBinding.use().equals(SOAPBinding.Use.ENCODED)) { 808 public Use use() {return SOAPBinding.Use.LITERAL; } method in class:WebServiceVisitor.MySOAPBinding
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/xsom/impl/util/ |
H A D | SchemaTreeTraverser.java | 85 * use {@link SchemaTreeTraverser.SchemaTreeCellRenderer} as a cell renderer for 463 public void attributeUse(XSAttributeUse use) { argument 464 XSAttributeDecl decl = use.getDecl(); 468 if (use.isRequired()) { 469 additionalAtts += " use=\"required\""; 471 if (use.getFixedValue() != null 472 && use.getDecl().getFixedValue() == null) { 473 additionalAtts += " fixed=\"" + use.getFixedValue() + "\""; 475 if (use.getDefaultValue() != null 476 && use [all...] |
/openjdk7/hotspot/src/share/vm/memory/ |
H A D | universe.hpp | 199 // number of preallocated error objects available for use 366 static void set_narrow_oop_use_implicit_null_checks(bool use) { _narrow_oop._use_implicit_null_checks = use; } argument
|
/openjdk7/jdk/src/solaris/native/java/net/ |
H A D | net_util_md.c | 527 * and override the scope_id field to use the relevant value for "lo" 591 int dest_plen, src_plen, use, refcnt, metric; local 623 &metric, &use, &refcnt, &flags, device) == 31) { 865 * If the scope was cached the we use the cached value. If not cached but 866 * specified in the Inet6Address we use that, but we first check if the 871 * cases the used value is cached for further use. 880 /* if cached value exists then use it. Otherwise, check 914 * If we have a scope_id use the extended form 1090 * This will tell us the interface to use (eg: "eth0"). 1098 * >1 interface index to use fo 1105 int dest_plen, src_plen, use, refcnt, metric; local [all...] |
/openjdk7/jdk/src/windows/classes/sun/nio/fs/ |
H A D | WindowsNativeDispatcher.java | 701 private int use; field in class:WindowsNativeDispatcher.Account 706 public int use() { return use; } method in class:WindowsNativeDispatcher.Account
|