Searched refs:EQ (Results 26 - 50 of 101) sorted by relevance

12345

/openjdk10/nashorn/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/api/tree/
H A DTreeImpl.java112 case EQ:
/openjdk10/langtools/src/jdk.compiler/share/classes/com/sun/tools/javac/comp/
H A DInfer.java460 for (Type t : from.getBounds(InferenceBound.EQ, InferenceBound.LOWER)) {
489 for (Type t : from.getBounds(InferenceBound.EQ, InferenceBound.LOWER)) {
682 Optional<Type> inst = uv.getBounds(InferenceBound.EQ).stream()
790 return (from == InferenceBound.EQ) ?
815 } else if (from == InferenceBound.LOWER || to == InferenceBound.EQ) {
844 return (from == InferenceBound.EQ) ?
846 EnumSet.of(InferenceBound.EQ);
862 super(uv, uv.getInst(), InferenceBound.EQ);
887 super(uv, InferenceBound.LOWER, InferenceBound.EQ, InferenceBound.UPPER);
1019 return (ib == InferenceBound.EQ)
1439 EQ(InferenceBound.EQ) { method in enum:Infer.InferenceStep
1600 EQ(EnumSet.of(InferenceStep.EQ)), enum constant in enum:Infer.GraphInferenceSteps
[all...]
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.lir.aarch64/src/org/graalvm/compiler/lir/aarch64/
H A DAArch64Compare.java126 // If the condition is "EQ || unordered" or "NE && unordered" we have to use 2 registers
128 if (!(condition == Condition.EQ && unorderedIsTrue || condition == Condition.NE && !unorderedIsTrue)) {
140 // There is no condition code for "EQ || unordered" nor one for "NE && unordered",
142 // In both cases we combine the asked for condition into the EQ, respectively NE
144 // if EQ && unoreredIsTrue, then the EQ flag will be set if the two values gpCompare
147 if (condition == Condition.EQ && unorderedIsTrue) {
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core.sparc/src/org/graalvm/compiler/core/sparc/
H A DSPARCNodeMatchRules.java150 assert compare.condition() == Condition.EQ;
169 Condition condition = successIsTrue ? Condition.EQ : Condition.NE;
/openjdk10/hotspot/src/cpu/aarch64/vm/
H A DtemplateTable_aarch64.cpp129 case TemplateTable::not_equal : return Assembler::EQ;
136 return Assembler::EQ;
276 __ br(Assembler::EQ, L_okay);
278 __ br(Assembler::EQ, L_okay);
392 __ br(Assembler::EQ, call_ldc);
397 __ br(Assembler::EQ, call_ldc);
424 __ br(Assembler::EQ, L);
526 __ br(Assembler::EQ, done);
531 __ br(Assembler::EQ, rewrite);
536 __ br(Assembler::EQ, rewrit
1779 r0, rscratch2, false, Assembler::EQ, &backedge_counter_overflow); member in class:Assembler
[all...]
H A DtemplateInterpreterGenerator_aarch64.cpp576 __ increment_mask_and_jump(mdo_invocation_counter, increment, mask, rscratch1, rscratch2, false, Assembler::EQ, overflow);
586 __ increment_mask_and_jump(invocation_counter, increment, mask, rscratch1, r1, false, Assembler::EQ, overflow);
782 __ br(Assembler::EQ, done);
1145 __ br(Assembler::EQ, L);
1188 __ br(Assembler::EQ, L);
1203 __ br(Assembler::EQ, L);
1301 __ br(Assembler::EQ, L);
1609 __ br(Assembler::EQ, L);
1616 __ br(Assembler::EQ, L);
1667 __ br(Assembler::EQ,
[all...]
H A Dinterp_masm_aarch64.cpp54 br(Assembler::EQ, done);
739 br(Assembler::EQ, done);
860 br(Assembler::EQ, verify_continue);
1602 br(Assembler::EQ, next); // klass seen before, nothing to
1612 br(Assembler::EQ, none);
1619 br(Assembler::EQ, next);
1728 br(Assembler::EQ, do_profile);
1730 br(Assembler::EQ, do_profile);
H A Dc1_LIRAssembler_aarch64.cpp301 __ br(Assembler::EQ, dont);
1126 // Assembler::EQ does not permit unordered branches, so we add
1133 case lir_cond_equal: acond = Assembler::EQ; break;
1140 acond = Assembler::EQ; // unreachable
1144 case lir_cond_equal: acond = Assembler::EQ; break;
1153 acond = Assembler::EQ; // unreachable
1423 __ br(Assembler::EQ, *success_target);
1426 __ br(Assembler::EQ, *success_target);
1627 case lir_cond_equal: acond = Assembler::EQ; ncond = Assembler::NE; break;
1628 case lir_cond_notEqual: acond = Assembler::NE; ncond = Assembler::EQ; brea
[all...]
H A Ddecode_aarch64.hpp44 EQ = 0b0000, // meaning Z == 1 enumerator in enum:CondCode
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/calc/
H A DCompareNode.java108 return condition == Condition.EQ;
247 if (condition == Condition.EQ) {
281 if (condition == Condition.EQ) {
H A DIntegerEqualsNode.java57 super(TYPE, Condition.EQ, false, x, y);
63 LogicNode result = CompareNode.tryConstantFoldPrimitive(Condition.EQ, x, y, false);
88 LogicNode value = OP.canonical(constantReflection, metaAccess, options, smallestCompareWidth, Condition.EQ, false, x, y);
97 ValueNode value = OP.canonical(tool.getConstantReflection(), tool.getMetaAccess(), tool.getOptions(), tool.smallestCompareWidth(), Condition.EQ, false, forX, forY);
H A DNormalizeCompareNode.java69 LogicNode result = CompareNode.tryConstantFold(Condition.EQ, x, y, null, false);
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/inlining/info/
H A DTypeGuardInlineInfo.java116 LogicNode typeCheck = CompareNode.createCompareNode(graph, Condition.EQ, receiverHub, typeHub, providers.getConstantReflection());
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/extended/
H A DBranchProbabilityNode.java100 assert node.condition() == Condition.EQ;
/openjdk10/langtools/src/jdk.javadoc/share/classes/com/sun/tools/javadoc/main/
H A DJavadocMemberEnter.java155 case EQ: case NE:
/openjdk10/langtools/src/jdk.javadoc/share/classes/jdk/javadoc/internal/tool/
H A DJavadocMemberEnter.java147 case EQ: case NE:
/openjdk10/nashorn/test/script/basic/
H A DJDK-8035712.js40 function EQ(x, y) { function
130 EQ(val, obj);
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core.amd64/src/org/graalvm/compiler/core/amd64/
H A DAMD64NodeMatchRules.java195 gen.append(new BranchOp(Condition.EQ, trueLabel, falseLabel, trueLabelProbability));
202 gen.append(new BranchOp(Condition.EQ, trueLabel, falseLabel, trueLabelProbability));
305 assert compare.condition() == Condition.EQ;
315 getLIRGeneratorTool().emitCompareAndSwapBranch(kind, address, expectedValue, newValue, Condition.EQ, trueLabel, falseLabel, trueLabelProbability);
328 assert compare.condition() == Condition.EQ;
347 Condition condition = successIsTrue ? Condition.EQ : Condition.NE;
H A DAMD64LIRGenerator.java198 append(new CondMoveOp(result, Condition.EQ, asAllocatable(trueValue), falseValue));
221 assert condition == Condition.EQ || condition == Condition.NE;
288 append(new BranchOp(Condition.EQ, trueDestination, falseDestination, trueDestinationProbability));
309 append(new CondMoveOp(result, Condition.EQ, load(trueValue), loadNonConst(falseValue)));
/openjdk10/jdk/src/java.base/share/classes/sun/security/util/
H A DDisabledAlgorithmConstraints.java440 EQ, // "==" enum constant in enum:DisabledAlgorithmConstraints.Constraint.Operator
450 return EQ;
759 case EQ: // an unavailable key size
/openjdk10/nashorn/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/ir/visitor/
H A DNodeOperatorVisitor.java150 case EQ:
234 case EQ:
/openjdk10/nashorn/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/codegen/
H A DFoldConstants.java361 case EQ:
362 return LiteralNode.newInstance(token, finish, ScriptRuntime.EQ(lhs.getObject(), rhs.getObject()));
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.hotspot/src/org/graalvm/compiler/hotspot/replacements/
H A DClassGetHubNode.java172 assert op == Condition.EQ || op == Condition.NE;
/openjdk10/jdk/src/jdk.rmic/share/classes/sun/tools/tree/
H A DBinaryExpression.java100 case EQ:
/openjdk10/nashorn/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/parser/
H A DTokenType.java85 EQ (BINARY, "==", 9, true), enum constant in enum:TokenType

Completed in 154 milliseconds

12345