Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched defs:if_true (Results 1 - 25 of 34) sorted by null

1 2

/external/protobuf/src/google/protobuf/stubs/
template_util_unittest.cc	64 typedef if_<true, true_type, false_type>::type if_true; typedef 65 EXPECT_TRUE(if_true::value);
/external/v8/src/compiler/
diamond.h	21 Node* if_true; member in struct:v8::internal::compiler::Diamond 30 if_true = graph->NewNode(common->IfTrue(), branch); 32 merge = graph->NewNode(common->Merge(2), if_true, if_false); 41 // Nest {this} into either the if_true or if_false branch of {that}. 42 void Nest(Diamond& that, bool if_true) { 43 if (if_true) { 44 branch->ReplaceInput(1, that.if_true);
common-operator-reducer.cc	169 Node* if_true = node->InputAt(0); local 171 if (if_true->opcode() != IrOpcode::kIfTrue) std::swap(if_true, if_false); 172 if (if_true->opcode() == IrOpcode::kIfTrue && 174 if_true->InputAt(0) == if_false->InputAt(0) && if_true->OwnedBy(node) && 176 Node* const branch = if_true->InputAt(0); 178 DCHECK(branch->OwnedBy(if_true, if_false)); 224 Node* if_true = merge->InputAt(0); local 226 if (if_true->opcode() != IrOpcode::kIfTrue)     [all...]
control-flow-optimizer.cc	221 Node* if_true; local 226 if_true = matcher.IfTrue(); 246 if_true->ReplaceInput(0, node); 248 NodeProperties::ChangeOp(if_true, common()->IfValue(value)); 250 Enqueue(if_true); 266 if_true->ReplaceInput(0, node); 267 NodeProperties::ChangeOp(if_true, common()->IfValue(value)); 268 Enqueue(if_true);
memory-optimizer.cc	183 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 205 control = graph()->NewNode(common()->Merge(2), if_true, if_false); 251 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 258 top_address, jsgraph()->IntPtrConstant(0), new_top, etrue, if_true); 281 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
js-generic-lowering.cc	687 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 694 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
js-intrinsic-lowering.cc	194 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 207 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
effect-control-linearizer.cc	593 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 599 control = graph()->NewNode(common()->Merge(2), if_true, if_false); 631 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 633 AllocateHeapNumberWithValue(ChangeInt32ToFloat64(value), effect, if_true); 657 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 664 Node* merge = graph()->NewNode(common()->Merge(2), if_true, alloc.control); 700 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 715 control = graph()->NewNode(common()->Merge(2), if_true, if_false); 732 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 747 control = graph()->NewNode(common()->Merge(2), if_true, if_false) 770 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 966 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 1015 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 1054 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 1087 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 1119 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 1158 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 1190 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 1235 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 1270 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local     [all...]
simplified-lowering.cc	2370 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local     [all...]
/art/compiler/optimizing/
graph_test.cc	79 HBasicBlock* if_true = createGotoBlock(graph, &allocator); local 84 if_block->AddSuccessor(if_true); 85 if_true->AddSuccessor(return_block); 89 ASSERT_EQ(if_block->GetLastInstruction()->AsIf()->IfTrueSuccessor(), if_true); 95 ASSERT_EQ(if_block->GetLastInstruction()->AsIf()->IfTrueSuccessor(), if_true);
induction_var_analysis.cc	575 HBasicBlock* if_true = ifs->IfTrueSuccessor(); local 590 } else if (if_true->GetLoopInformation() != loop && if_false->GetLoopInformation() == loop) { 592 } else if (if_true->GetLoopInformation() == loop && if_false->GetLoopInformation() != loop) {     [all...]
/external/v8/src/
code-stub-assembler.h	92 void BranchIfSmiLessThan(compiler::Node* a, compiler::Node* b, Label* if_true, 94 BranchIf(SmiLessThan(a, b), if_true, if_false); local 98 Label* if_true, Label* if_false) { 99 BranchIf(SmiLessThanOrEqual(a, b), if_true, if_false); local 102 void BranchIfFloat64IsNaN(compiler::Node* value, Label* if_true, 104 BranchIfFloat64Equal(value, value, if_false, if_true);
/external/v8/test/unittests/compiler/
control-flow-optimizer-unittest.cc	111 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 113 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
node-properties-unittest.cc	91 Node* if_true = NewMockNode(common.IfTrue(), branch); local 93 EXPECT_EQ(if_true, result[0]);
common-operator-reducer-unittest.cc	79 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); local 82 EXPECT_CALL(editor, Replace(if_true, IsDead())); 96 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); local 99 EXPECT_CALL(editor, Replace(if_true, control)); 113 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); local 116 EXPECT_CALL(editor, Replace(if_true, IsDead())); 130 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); local 133 EXPECT_CALL(editor, Replace(if_true, control)); 149 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); local 156 EXPECT_THAT(if_true, IsIfFalse(branch)) 170 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); local 184 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); local 292 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 312 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 332 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 350 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 368 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 386 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 406 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local     [all...]
effect-control-linearizer-unittest.cc	92 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 96 graph()->start(), if_true); 101 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); 121 schedule.AddNode(tblock, if_true); 276 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 291 Node* ret = graph()->NewNode(common()->Return(), load, effect_phi, if_true); 316 schedule.AddNode(rblock, if_true); 323 ASSERT_THAT(ret, IsReturn(load, load, if_true));
loop-peeling-unittest.cc	30 Node* if_true; member in struct:v8::internal::compiler::While 38 Node* if_true; member in struct:v8::internal::compiler::Branch 110 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 112 loop->ReplaceInput(1, if_true); 113 return {loop, branch, if_true, exit}; 119 a->loop->ReplaceInput(0, b->if_true); 129 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 131 return {branch, if_true, if_false}; 154 Node* if_true1 = ExpectPeeled(w.if_true, peeled); 161 EXPECT_THAT(w.loop, IsLoop(if_true1, w.if_true));     [all...]
node-matchers-unittest.cc	737 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 742 EXPECT_EQ(if_true, matcher.IfTrue()); 749 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 753 EXPECT_EQ(if_true, matcher.IfTrue()); 760 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 765 EXPECT_EQ(if_true, matcher.IfTrue()); 777 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 780 USE(if_true); 798 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 801 EXPECT_FALSE(BranchMatcher(if_true).Matched()) 807 Node* if_true = graph()->NewNode(common()->IfTrue(), sw); local 816 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 831 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 845 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 857 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 875 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 893 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 910 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 920 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local 929 Node* if_true = graph()->start(); local 941 Node* if_true = graph()->NewNode(common()->IfTrue(), branch1); local     [all...]
/external/v8/test/cctest/compiler/
test-osr.cc	185 CHECK(!nodes.IsLive(d.if_true)); 197 Node* if_true = T.graph.NewNode(T.common.IfTrue(), branch); local 199 loop->ReplaceInput(2, if_true); 209 CheckInputs(loop, T.start, if_true); 211 CheckInputs(if_true, branch); 298 Node* if_true; member in struct:v8::internal::compiler::While 306 if_true = t.graph.NewNode(t.common.IfTrue(), branch); 308 loop->ReplaceInput(loop->InputCount() - 1, if_true); 313 this->loop->ReplaceInput(0, that.if_true); 361 CheckInputs(inner.loop, T.start, inner.if_true); 519 Node* if_true = T.graph.NewNode(T.common.IfTrue(), branch); local     [all...]
test-loop-analysis.cc	189 Node* if_true; member in struct:v8::internal::compiler::While 196 if_true = t.graph.NewNode(t.common.IfTrue(), branch); 198 loop->ReplaceInput(1, if_true); 204 this->loop->ReplaceInput(0, that.if_true); 261 Node* body[] = {w.branch, w.if_true}; 278 Node* body[] = {w.branch, w.if_true}; 294 Node* body[] = {w.branch, w.if_true, c.add}; 310 Node* body[] = {w.branch, w.if_true, c.store}; 327 Node* body[] = {w.branch, w.if_true, c1.add, c2.add}; 345 Node* body[] = {w1.branch, w1.if_true}; 624 Node* if_true = t.graph.NewNode(t.common.IfTrue(), branch); local 661 Node* if_true = t.graph.NewNode(t.common.IfTrue(), branch); local 696 Node* if_true = t.graph.NewNode(t.common.IfTrue(), branch); local 934 Node* if_true = t.graph.NewNode(t.common.IfTrue(), branch); local 970 Node* if_true = t.graph.NewNode(t.common.IfTrue(), branch); local     [all...]
/external/v8/src/wasm/
ast-decoder.cc	679 TFNode* if_true = nullptr; local 681 BUILD(Branch, cond.node, &if_true, &if_false); 686 true_env->control = if_true;     [all...]
/external/pcre/dist/sljit/
sljitNativeMIPS_common.c	1863 sljit_si if_true; local     [all...]
/external/v8/src/full-codegen/arm/
full-codegen-arm.cc	648 Label* if_true, 654 Split(eq, if_true, if_false, fall_through); 659 Label* if_true, 663 __ b(cond, if_true); 664 } else if (if_true == fall_through) { 667 __ b(cond, if_true); 731 Label* if_true, 744 Split(eq, if_true, if_false, NULL); 2697 Label* if_true = NULL; local 2718 Label* if_true = NULL; local 2740 Label* if_true = NULL; local 2762 Label* if_true = NULL; local 2784 Label* if_true = NULL; local 2806 Label* if_true = NULL; local 2974 Label* if_true = NULL; local 3445 Label* if_true = NULL; local 3532 Label* if_true = NULL; local 3598 Label* if_true = NULL; local     [all...]
/external/v8/src/full-codegen/arm64/
full-codegen-arm64.cc	643 Label* if_true, 649 Split(eq, if_true, if_false, fall_through); 653 // If (cond), branch to if_true. 658 Label* if_true, 662 __ B(cond, if_true); 663 } else if (if_true == fall_through) { 667 __ B(cond, if_true); 725 Label* if_true, 740 Split(eq, if_true, if_false, NULL); 2601 Label* if_true = NULL; local 2621 Label* if_true = NULL; local 2643 Label* if_true = NULL; local 2665 Label* if_true = NULL; local 2687 Label* if_true = NULL; local 2709 Label* if_true = NULL; local 2886 Label* if_true = NULL; local 3368 Label* if_true = NULL; local 3462 Label* if_true = NULL; local 3528 Label* if_true = NULL; local     [all...]
/external/v8/src/full-codegen/ia32/
full-codegen-ia32.cc	600 Label* if_true, 606 Split(equal, if_true, if_false, fall_through); 611 Label* if_true, 615 __ j(cc, if_true); 616 } else if (if_true == fall_through) { 619 __ j(cc, if_true); 680 Label* if_true, 692 Split(equal, if_true, if_false, NULL); 2583 Label* if_true = NULL; local 2604 Label* if_true = NULL; local 2626 Label* if_true = NULL; local 2648 Label* if_true = NULL; local 2670 Label* if_true = NULL; local 2692 Label* if_true = NULL; local 2866 Label* if_true = NULL; local 3345 Label* if_true = NULL; local 3430 Label* if_true = NULL; local 3498 Label* if_true = NULL; local     [all...]

Completed in 250 milliseconds

1 2