Searched defs:def (Results 26 - 50 of 55) sorted by relevance

123

/openjdk7/hotspot/src/share/vm/ci/
H A DciInstanceKlass.cpp372 klassOop def = k->find_field(name->get_symbol(), signature->get_symbol(), is_static, &fd); local
373 if (def == NULL) {
/openjdk7/hotspot/src/share/vm/opto/
H A DbuildOopMap.cpp60 // GC point we'll have the reaching-def Nodes. If the reaching Nodes are
68 // irreducible loops, we can have a reaching def of an oop that only reaches
77 // The reaching def's is a simple 1-pass worklist approach. I tried a clever
85 // practice. One array will map to a reaching def Node (or NULL for
94 Node **_defs; // array mapping register to reaching def
139 // Assign new reaching def's.
256 // See if dead (no reaching def).
257 Node *def = _defs[reg]; // Get reaching def local
258 assert( def, "sinc
476 Node *def = n->in(l); local
[all...]
H A Difg.cpp373 // to the instruction and kills the src-def'd register.
570 Node *def = n->in(0); local
573 (n2lidx(def) && !liveout.member(n2lidx(def)) ) ) {
749 // they also def flags; if that flag def is unused the
755 Node *def = n->in(k); local
756 uint x = n2lidx(def);
763 lrg._cost += (def->rematerialize() ? b->_freq : (b->_freq + b->_freq));
H A Dpostaloc.cpp43 bool PhaseChaitin::may_be_copy_of_callee( Node *def ) const {
58 if( def->is_Proj() && def->in(0)->is_Start() &&
59 _matcher.is_save_on_entry(lrgs(n2lidx(def)).reg()) )
61 if( def->is_Copy() ) // Copies carry value through
62 def = def->in(def->is_Copy());
63 else if( def->is_Phi() ) // Phis can merge it from any direction
64 def
158 use_prior_register( Node *n, uint idx, Node *def, Block *current_block, Node_List &value, Node_List &regnd ) argument
559 Node *def = n->in(k); // n->in(k) is a USE; def is the DEF for this USE local
[all...]
H A Dcoalesce.cpp237 // Combine the live ranges def'd by these 2 Nodes. N2 is an input to N1.
293 // to carry values instead of the explicit use-def chains. Suppose I need to
297 // direct use-def chains get me the right value. It DOES happen in the named
394 Node *def = copy->in(cidx); local
395 if( _phc.Find(copy) == _phc.Find(def) )
396 n->set_req(k,def);
403 Node *def = n->in(cidx); local
404 if( _phc.Find(n) == _phc.Find(def) ) {
405 n->replace_by(def);
440 // Insert the copy in the use-def chai
[all...]
H A Dreg_split.cpp54 static bool contains_no_live_range_input(const Node* def) { argument
55 for (uint i = 1; i < def->req(); ++i) {
56 if (def->in(i) != NULL && def->in_RegMask(i).is_NotEmpty()) {
67 Node *PhaseChaitin::get_spillcopy_wide( Node *def, Node *use, uint uidx ) { argument
71 int ireg = def->ideal_reg();
80 const RegMask *i_mask = &def->out_RegMask();
105 return new (C) MachSpillCopyNode( def, *w_i_mask, *w_o_mask );
152 uint PhaseChaitin::split_DEF( Node *def, Block *b, int loc, uint maxlrg, Node **Reachblock, Node **debug_defs, GrowableArray<uint> splits, int slidx ) { argument
163 if( be->is_MachNullCheck() && be->in(1) == def
192 split_USE( Node *def, Block *b, Node *use, uint useidx, uint maxlrg, bool def_down, bool cisc_sp, GrowableArray<uint> splits, int slidx ) argument
294 clone_node(Node* def, Block *b, Compile* C) argument
320 split_Rematerialize( Node *def, Block *b, uint insidx, uint &maxlrg, GrowableArray<uint> splits, int slidx, uint *lrg2reach, Node **Reachblock, bool walkThru ) argument
885 Node *def = Reachblock[slidx]; local
1298 Node *def = Reaches[pidx][slidx]; local
[all...]
H A Dlcm.cpp380 // Since schedule-local needs precise def-use info, we need to correct
910 static Node *catch_cleanup_find_cloned_def(Block *use_blk, Node *def, Block *def_blk, Block_Array &bbs, int n_clone_idx) { argument
913 // The use is some block below the Catch. Find and return the clone of the def
915 // create a phi for the def in a dominating block.
933 // PhiNode, the PhiNode uses from the def and IT's uses need fixup.
936 inputs.map(k, catch_cleanup_find_cloned_def(bbs[use_blk->pred(k)->_idx], def, def_blk, bbs, n_clone_idx));
941 // def are processed together.
956 Node *new_phi = PhiNode::make(use_blk->head(), def);
974 // Fix all input edges in use that reference "def". The use is in the same
975 // block as the def an
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
[all...]
H A Dgcm.cpp312 // We are placing a definition, and have been given a def->use edge.
315 // the LCA only with the phi input paths which actually use this def.
316 static Block* raise_LCA_above_use(Block* LCA, Node* use, Node* def, Block_Array &bbs) { argument
322 // the Phi? Well...it's like this. I do not have true def-use/use-def
323 // chains. Means I cannot distinguish, from the def-use direction, which
324 // of many use-defs lead from the same use to the same def. That is, this
325 // Phi might have several uses of the same def. Each use appears in a
327 // which use-def edge I should find the predecessor block for. So I find
331 if (use->in(j) == def) { // Foun
889 Node *def = n->in(j); local
932 latency_from_use(Node *n, const Node *def, Node *use) argument
999 const Node *def = n->is_Proj() ? n->in(0): n; local
1159 Node *def = self->in(1); local
[all...]
H A Dloopopts.cpp1308 // Copy uses to a worklist, so I can munge the def-use info
1377 // Copy uses to a worklist, so I can munge the def-use info
1498 // from the IF up to where the original BOOL def exists the loop.
1861 Node* def = elt->in(j); local
1862 if (def && member.test(def->_idx) && def != elt) {
1974 // If these def-uses occur in separate blocks, the code generator
2050 Node *def = loop->_body.at(i); local
2051 uint di = def
2097 Node *def = peel_list.at(i); local
2587 Node *def = peel_list.at(i); local
[all...]
H A Dnode.cpp570 //assert(def->out(def->outcnt()-1) == (Node *)this,"bad def-use hacking in reclaim");
769 // First remove corresponding def-use edge
787 if (n != NULL) n->add_out((Node *)this); // Add reciprocal def-use edge
1023 // either case, def-use info is correctly maintained.
1039 // The Right Thing with def-use info.
1216 // worklist but this call is more efficient. Do not update use-def info
1813 // Verify my input has a def-use edge to me
1815 // Count use-def edge
1966 Node* def = in(1); local
[all...]
/openjdk7/jdk/src/share/classes/com/sun/java/util/jar/pack/
H A DInstruction.java485 def("b", _nop, _dconst_1);
486 def("bx", _bipush);
487 def("bxx", _sipush);
488 def("bk", _ldc); // do not pack
489 def("bkk", _ldc_w, _ldc2_w); // do not pack
490 def("blwbll", _iload, _aload);
491 def("b", _iload_0, _saload);
492 def("blwbll", _istore, _astore);
493 def("b", _istore_0, _lxor);
494 def("blxwbllx
600 private static void def(String fmt, int bc) { method in class:Instruction
603 private static void def(String fmt, int from_bc, int to_bc) { method in class:Instruction
[all...]
H A DAttribute.java51 Layout def; // the name and format of this attr field in class:Attribute
55 public String name() { return def.name(); }
56 public Layout layout() { return def; }
59 public Entry getNameRef() { return def.getNameRef(); }
62 this.def = old.def;
67 public Attribute(Layout def, byte[] bytes, Object fixups) { argument
68 this.def = def;
73 public Attribute(Layout def, byt argument
[all...]
/openjdk7/jdk/src/share/classes/com/sun/imageio/plugins/png/
H A DPNGImageWriter.java162 Deflater def = new Deflater(Deflater.BEST_COMPRESSION); field in class:IDATOutputStream
212 if (!def.finished()) {
213 def.setInput(b, off, len);
214 while (!def.needsInput()) {
221 int len = def.deflate(buf, 0, buf.length);
248 if (!def.finished()) {
249 def.finish();
250 while (!def.finished()) {
256 def.end();
/openjdk7/hotspot/src/share/vm/runtime/
H A DmutexLocker.cpp171 #define def(var, type, pri, vm_block) { \ macro
179 def(tty_lock , Mutex , event, true ); // allow to lock in VM
181 def(CGC_lock , Monitor, special, true ); // coordinate between fore- and background GC
182 def(STS_init_lock , Mutex, leaf, true );
184 def(iCMS_lock , Monitor, special, true ); // CMS incremental mode start/stop notification
187 def(FullGCCount_lock , Monitor, leaf, true ); // in support of ExplicitGCInvokesConcurrent
190 def(CMark_lock , Monitor, nonleaf, true ); // coordinate concurrent mark thread
191 def(CMRegionStack_lock , Mutex, leaf, true );
192 def(SATB_Q_FL_lock , Mutex , special, true );
193 def(SATB_Q_CBL_mo
[all...]
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/compiler/
H A DParser.java1087 * @param def - default expression (if the attribute was not found)
1090 String attr, String def) {
1094 if ((exp.length() == 0) && (def != null)) exp = def;
1112 * @param def - default pattern (if the attribute was not found)
1115 String attr, String def) {
1119 if ((pattern.length() == 0) && (def != null)) pattern = def;
1089 parseExpression(SyntaxTreeNode parent, String attr, String def) argument
1114 parsePattern(SyntaxTreeNode parent, String attr, String def) argument
/openjdk7/hotspot/src/share/vm/adlc/
H A DarchDesc.cpp664 void ArchDesc::set_preproc_def(const char* flag, const char* def) { argument
671 deff->_code = (char*) def;
1142 char* def = get_preproc_def(flag); local
1144 if (def)
1145 fprintf(fp, "-D%s=%s\n", flag, def);
1148 def ? "ifndef" : "ifdef", flag);
1150 flag, def ? "must" : "must not");
H A Dformsopt.cpp263 const RegDef* def = NULL; local
266 while ((def = RegDef_iter()) != NULL) {
267 if (first == NULL || def->register_num() < first->register_num()) {
268 first = def;
/openjdk7/corba/src/share/classes/sun/rmi/rmic/iiop/
H A DCompoundType.java1400 protected boolean inheritsFrom(ClassDefinition def, ClassDefinition otherDef) { argument
1401 if (def == otherDef)
1405 if (def.getSuperClass() != null) {
1406 superDef = def.getSuperClass().getClassDefinition();
1411 ClassDeclaration[] interfaces = def.getInterfaces();
1437 ClassDefinition def = interfaces[i].getClassDefinition(env);
1441 InterfaceType it = SpecialInterfaceType.forSpecial(def,stack);;
1451 it = RemoteType.forRemote(def,stack,false);
1457 it = AbstractType.forAbstract(def,stack,true);
1463 it = NCInterfaceType.forNCInterface(def,stac
[all...]
/openjdk7/jdk/src/share/classes/javax/swing/text/html/
H A DHTML.java626 * @param def the default value to use if the attribute isn't
630 Attribute key, int def) {
631 int value = def;
637 value = def;
629 getIntegerAttributeValue(AttributeSet attr, Attribute key, int def) argument
/openjdk7/hotspot/src/share/tools/launcher/
H A Djava.c881 char *def; local
883 def = JLI_MemAlloc(strlen(s) + 40);
884 sprintf(def, "-Djava.class.path=%s", s);
885 AddOption(def, NULL);
/openjdk7/jdk/src/share/bin/
H A Djava.c693 char *def; local
704 def = JLI_MemAlloc(sizeof(format)
707 sprintf(def, format, s);
708 AddOption(def, NULL);
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/tree/
H A DTreeMaker.java338 JCClassDecl def)
340 JCNewClass tree = new JCNewClass(encl, typeargs, clazz, args, def);
510 public LetExpr LetExpr(JCVariableDecl def, JCTree expr) { argument
511 LetExpr tree = new LetExpr(List.of(def), expr);
334 NewClass(JCExpression encl, List<JCExpression> typeargs, JCExpression clazz, List<JCExpression> args, JCClassDecl def) argument
/openjdk7/jdk/src/share/demo/nio/zipfs/src/com/sun/nio/zipfs/
H A DZipFileSystem.java288 for (Deflater def : deflaters)
289 def.end();
1578 e.size = def.getBytesRead();
1579 e.csize = def.getBytesWritten();
1595 releaseDeflater(def);
1599 releaseDeflater(def);
1648 Deflater def = (Deflater)deflaters.remove(size - 1);
1649 return def;
1657 private void releaseDeflater(Deflater def) { argument
1660 def
[all...]
/openjdk7/jdk/src/share/classes/sun/rmi/server/
H A DActivation.java186 private static int getInt(String name, int def) { argument
187 return AccessController.doPrivileged(new GetIntegerAction(name, def));
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/interpreter/
H A DBytecodes.java560 def(_nop , "nop" , "b" , null , BasicType.getTVoid() , 0, false);
561 def(_aconst_null , "aconst_null" , "b" , null , BasicType.getTObject() , 1, false);
562 def(_iconst_m1 , "iconst_m1" , "b" , null , BasicType.getTInt() , 1, false);
563 def(_iconst_0 , "iconst_0" , "b" , null , BasicType.getTInt() , 1, false);
564 def(_iconst_1 , "iconst_1" , "b" , null , BasicType.getTInt() , 1, false);
565 def(_iconst_2 , "iconst_2" , "b" , null , BasicType.getTInt() , 1, false);
566 def(_iconst_3 , "iconst_3" , "b" , null , BasicType.getTInt() , 1, false);
567 def(_iconst_4 , "iconst_4" , "b" , null , BasicType.getTInt() , 1, false);
568 def(_iconst_5 , "iconst_5" , "b" , null , BasicType.getTInt() , 1, false);
569 def(_lconst_
821 private static void def(int code, String name, String format, String wide_format, int result_type, int depth, boolean can_trap) { method in class:Bytecodes
825 private static void def(int code, String name, String format, String wide_format, int result_type, int depth, boolean can_trap, int java_code) { method in class:Bytecodes
[all...]

Completed in 140 milliseconds

123