Lines Matching defs:cond
70 Decision CommonOperatorReducer::DecideCondition(Node* const cond) {
71 Node* unwrapped = SkipValueIdentities(cond);
94 Node* const cond = node->InputAt(0);
95 // Swap IfTrue/IfFalse on {branch} if {cond} is a BooleanNot and use the input
96 // to BooleanNot as new condition for {branch}. Note we assume that {cond} was
98 // reduction logic). The same applies if {cond} is a Select acting as boolean
100 if (cond->opcode() == IrOpcode::kBooleanNot ||
101 (cond->opcode() == IrOpcode::kSelect &&
102 DecideCondition(cond->InputAt(1)) == Decision::kFalse &&
103 DecideCondition(cond->InputAt(2)) == Decision::kTrue)) {
119 node->ReplaceInput(0, cond->InputAt(0));
125 Decision const decision = DecideCondition(cond);
152 // Swap DeoptimizeIf/DeoptimizeUnless on {node} if {cond} is a BooleaNot
154 // assume that {cond} was already properly optimized before we get here
263 Node* const cond = branch->InputAt(0);
264 if (cond->opcode() == IrOpcode::kFloat32LessThan) {
265 Float32BinopMatcher mcond(cond);
275 } else if (cond->opcode() == IrOpcode::kFloat64LessThan) {
276 Float64BinopMatcher mcond(cond);
391 Node* const cond = node->InputAt(0);
395 switch (DecideCondition(cond)) {
403 switch (cond->opcode()) {
405 Float32BinopMatcher mcond(cond);
416 Float64BinopMatcher mcond(cond);
471 Node* const cond = node->InputAt(0);
472 Decision decision = DecideCondition(cond);
485 Node* const cond = trap->InputAt(0);
486 Decision decision = DecideCondition(cond);