Searched defs:merge (Results 26 - 32 of 32) sorted by relevance

12

/openjdk7/langtools/src/share/classes/com/sun/tools/javac/comp/
H A DFlow.java508 void merge() { method in class:Flow
551 if (inits == null) merge();
568 if (inits == null) merge();
576 if (inits == null) merge();
/openjdk7/jdk/src/share/classes/sun/font/
H A DAttributeValues.java308 public AttributeValues merge(Map<? extends Attribute, ?>map) { method in class:AttributeValues
309 return merge(map, MASK_ALL);
312 public AttributeValues merge(Map<? extends Attribute, ?>map, method in class:AttributeValues
316 merge(((AttributeMap)map).getValues(), mask);
332 public AttributeValues merge(AttributeValues src) { method in class:AttributeValues
333 return merge(src, MASK_ALL);
336 public AttributeValues merge(AttributeValues src, int mask) { method in class:AttributeValues
359 return new AttributeValues().merge(map, mask);
808 return clone().merge(imStyles);
/openjdk7/hotspot/src/share/vm/oops/
H A DgenerateOopMap.cpp69 // '#' top, result of conflict merge
76 // Basic block headers are the only merge points. We use this iteration to
85 // merge exit state of BB into entry state of all successor BBs,
677 CellTypeState CellTypeState::merge(CellTypeState cts, int slot) const { function in class:CellTypeState
681 "merge of bottom values is handled elsewhere");
699 assert(result.is_valid_state(), "checking that CTS merge maintains legal state");
712 CellTypeState v = cts[i].merge(bbts[i], i);
727 // then we do not merge in the monitor state.
732 CellTypeState v = cts[i].merge(bbts[i], i);
777 // always merge loca
[all...]
/openjdk7/hotspot/src/share/vm/opto/
H A Dparse1.cpp161 // When paths are cut off, values at later merge points can rise
666 // associated with a merge that doesn't involve a backedge can
711 // Build normal and exceptional exit merge points.
1374 merge(bci());
1419 // If the successor has several predecessors, then it is a merge
1425 //------------------------------merge------------------------------------------
1446 //------------------------------merge------------------------------------------
1448 void Parse::merge(int target_bci) { function in class:Parse
1501 // If this path is dead, do not bother capturing it as a merge.
1572 // Compute where to merge int
[all...]
H A Dstringopts.cpp101 StringConcat* merge(StringConcat* other, Node* arg);
275 StringConcat* StringConcat::merge(StringConcat* other, Node* arg) { function in class:StringConcat
622 StringConcat* merged = sc->merge(other, arg);
1118 RegionNode *merge = new (C) RegionNode(3); local
1119 kit.gvn().set_type(merge, Type::CONTROL);
1120 i = new (C) PhiNode(merge, TypeInt::INT);
1122 sign = new (C) PhiNode(merge, TypeInt::INT);
1125 merge->init_req(1, __ IfTrue(iff));
1128 merge->init_req(2, __ IfFalse(iff));
1132 kit.set_control(merge);
[all...]
H A Dmemnode.cpp718 // the regular oop, some are the CastPP of the oop, all merge at Phi's which
979 MergeMemNode* merge = mem->as_MergeMem(); local
980 Node* new_st = merge->memory_at(alias_idx);
981 if (new_st == merge->base_memory()) {
983 current = merge->base_memory();
3915 // Usually, the merge has more than one input. In that case, where inputs
3921 // A merge can take a "wide" memory state as one of its narrow inputs.
3922 // This simply means that the merge observes out only the relevant parts of
3923 // the wide input. That is, wide memory states arriving at narrow merge inputs
3991 // (It is currently unimplemented.) As you can see, the resulting merge i
[all...]
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/code/
H A DTypes.java2735 Type merge = merge(cl1.head,cl2.head);
2736 return intersect(cl1.tail, cl2.tail).prepend(merge);
2765 private Type merge(Type c1, Type c2) { method in class:Types
3528 // t.tsym.type to t as there can be no merge problem.

Completed in 77 milliseconds

12