| /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 | 142 Node* if_true = node->InputAt(0); local
144 if (if_true->opcode() != IrOpcode::kIfTrue) std::swap(if_true, if_false);
145 if (if_true->opcode() == IrOpcode::kIfTrue &&
147 if_true->InputAt(0) == if_false->InputAt(0) && if_true->OwnedBy(node) &&
149 Node* const branch = if_true->InputAt(0);
151 DCHECK(branch->OwnedBy(if_true, if_false));
197 Node* if_true = merge->InputAt(0); local
199 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);
|
| js-global-object-specialization.cc | 210 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local
213 frame_state, effect, if_true);
|
| change-lowering.cc | 254 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local
256 AllocateHeapNumberWithValue(ChangeInt32ToFloat64(value), if_true);
261 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
287 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local
288 Node* vtrue = graph()->NewNode(op, LoadHeapNumberValue(value, if_true));
293 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
384 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local
385 Node* vtrue = LoadHeapNumberValue(value, if_true);
390 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
408 Node* if_true = graph()->NewNode(common()->IfTrue(), branch) local
[all...] |
| js-intrinsic-lowering.cc | 207 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local
220 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false);
250 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local
264 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
294 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local
308 control = graph()->NewNode(common()->Merge(2), if_true, if_false);
|
| js-native-context-specialization.cc | 743 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local
[all...] |
| js-generic-lowering.cc | 832 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local
[all...] |
| simplified-lowering.cc | 1534 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local
1591 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local
[all...] |
| wasm-compiler.cc | 159 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local
162 *control_ptr = iftrue ? if_true : if_false;
164 *control_ptr = iftrue ? if_false : if_true;
[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/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]);
|
| change-lowering-unittest.cc | 371 Capture<Node*> add, branch, heap_number, if_true; local
377 IsAllocateHeapNumber(_, CaptureEq(&if_true))),
384 CaptureEq(&if_true))),
387 IsMerge(AllOf(CaptureEq(&if_true), IsIfTrue(CaptureEq(&branch))),
402 Capture<Node*> branch, if_true; local
406 IsLoadHeapNumber(value, CaptureEq(&if_true)),
409 IsMerge(AllOf(CaptureEq(&if_true),
427 Capture<Node*> branch, if_true; local
432 IsChangeFloat64ToInt32(IsLoadHeapNumber(value, CaptureEq(&if_true))),
434 IsMerge(AllOf(CaptureEq(&if_true), IsIfTrue(CaptureEq(&branch)))
450 Capture<Node*> branch, if_true; local
528 Capture<Node*> branch, if_true; local
553 Capture<Node*> branch, if_true; local
577 Capture<Node*> branch, if_true; local
[all...] |
| 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));
147 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); local
150 EXPECT_CALL(editor, Replace(if_true, IsDead()))
164 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); local
183 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); local
204 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); local
218 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); local
326 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local
346 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local
366 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local
384 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local
402 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local
420 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local
440 Node* if_true = graph()->NewNode(common()->IfTrue(), branch); local
[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...] |
| 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...] |
| /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 | 723 TFNode* if_true = nullptr; local
725 BUILD(Branch, p->last()->node, &if_true, &if_false);
729 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 | 686 Label* if_true,
692 Split(eq, if_true, if_false, fall_through);
697 Label* if_true,
701 __ b(cond, if_true);
702 } else if (if_true == fall_through) {
705 __ b(cond, if_true);
769 Label* if_true,
782 Split(eq, if_true, if_false, NULL);
3091 Label* if_true = NULL; local
3112 Label* if_true = NULL; local
3134 Label* if_true = NULL; local
3156 Label* if_true = NULL; local
3178 Label* if_true = NULL; local
3204 Label* if_true = NULL; local
3226 Label* if_true = NULL; local
3248 Label* if_true = NULL; local
3270 Label* if_true = NULL; local
3294 Label* if_true = NULL; local
3418 Label* if_true = nullptr; local
3701 Label* if_true = NULL; local
4460 Label* if_true = NULL; local
4548 Label* if_true = NULL; local
4612 Label* if_true = NULL; local
[all...] |
| /external/v8/src/full-codegen/ia32/ |
| full-codegen-ia32.cc | 633 Label* if_true,
639 Split(equal, if_true, if_false, fall_through);
644 Label* if_true,
648 __ j(cc, if_true);
649 } else if (if_true == fall_through) {
652 __ j(cc, if_true);
713 Label* if_true,
725 Split(equal, if_true, if_false, NULL);
2966 Label* if_true = NULL; local
2987 Label* if_true = NULL; local
3009 Label* if_true = NULL; local
3031 Label* if_true = NULL; local
3053 Label* if_true = NULL; local
3080 Label* if_true = NULL; local
3102 Label* if_true = NULL; local
3124 Label* if_true = NULL; local
3146 Label* if_true = NULL; local
3170 Label* if_true = NULL; local
3298 Label* if_true = nullptr; local
3592 Label* if_true = NULL; local
4387 Label* if_true = NULL; local
4473 Label* if_true = NULL; local
4539 Label* if_true = NULL; local
[all...] |
