/external/v8/src/compiler/ |
D | control-builders.cc | 30 then_environment_->Merge(environment()); in End() 43 continue_environment_->Merge(environment()); in Continue() 49 break_environment_->Merge(environment()); in Break() 55 continue_environment_->Merge(environment()); in EndBody() 61 loop_environment_->Merge(environment()); in EndLoop() 115 environment()->Merge(body_environment_); in BeginCase() 120 break_environment_->Merge(environment()); in Break() 129 break_environment_->Merge(label_environment_); in EndSwitch() 130 break_environment_->Merge(environment()); in EndSwitch() 141 break_environment_->Merge(environment()); in Break() [all …]
|
D | change-lowering.cc | 209 if_smi = graph()->NewNode(common()->Merge(2), if_notzero, if_notnegative); in ChangeFloat64ToTagged() 210 if_box = graph()->NewNode(common()->Merge(2), if_box, if_negative); in ChangeFloat64ToTagged() 226 if_box = graph()->NewNode(common()->Merge(2), if_ovf, if_box); in ChangeFloat64ToTagged() 235 control = graph()->NewNode(common()->Merge(2), if_smi, if_box); in ChangeFloat64ToTagged() 261 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in ChangeInt32ToTagged() 293 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in ChangeTaggedToUI32() 332 const Operator* merge_op = common()->Merge(2); in ChangeTaggedToFloat64() 390 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in ChangeTaggedToFloat64() 415 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in ChangeUint32ToTagged()
|
/external/llvm/test/Transforms/JumpThreading/ |
D | basic.ll | 14 br label %Merge 18 br label %Merge 20 Merge: 48 br label %Merge 51 br i1 %cond, label %Merge, label %F2 53 Merge: 87 br label %Merge 93 br label %Merge 95 Merge: 123 br label %Merge [all …]
|
D | and-cond.ll | 14 br label %Merge 18 br label %Merge 20 Merge: 21 ; CHECK: Merge:
|
D | and-and-cond.ll | 14 br label %Merge 18 br label %Merge 20 Merge: 21 ; CHECK: Merge:
|
D | compare.ll | 13 br label %Merge 17 br label %Merge 19 Merge:
|
/external/llvm/lib/Fuzzer/test/ |
D | merge.test | 11 CHECK1: Merge: running the initial corpus {{.*}} of 3 units 12 CHECK1: Merge: written 0 out of 0 units 23 CHECK2: Merge: running the initial corpus {{.*}} of 3 units 24 CHECK2: Merge: written 3 out of 6 units 28 CHECK3: Merge: running the initial corpus {{.*}} of 6 units 29 CHECK3: Merge: written 0 out of 6 units
|
/external/webrtc/webrtc/modules/audio_coding/neteq/ |
D | merge.h | 34 class Merge { 36 Merge(int fs_hz, 40 virtual ~Merge() {} in ~Merge() 99 RTC_DISALLOW_COPY_AND_ASSIGN(Merge);
|
D | merge.cc | 27 Merge::Merge(int fs_hz, in Merge() function in webrtc::Merge 41 size_t Merge::Process(int16_t* input, size_t input_length, in Process() 159 size_t Merge::GetExpandedSignal(size_t* old_length, size_t* expand_period) { in GetExpandedSignal() 206 int16_t Merge::SignalScaling(const int16_t* input, size_t input_length, in SignalScaling() 263 void Merge::Downsample(const int16_t* input, size_t input_length, in Downsample() 310 size_t Merge::CorrelateAndPeakSearch(int16_t expanded_max, int16_t input_max, in CorrelateAndPeakSearch() 378 size_t Merge::RequiredFutureSamples() { in RequiredFutureSamples()
|
D | merge_unittest.cc | 26 TEST(Merge, CreateAndDestroy) { in TEST() argument 34 Merge merge(fs, channels, &expand, &sync_buffer); in TEST()
|
/external/v8/test/unittests/compiler/ |
D | branch-elimination-unittest.cc | 56 graph()->NewNode(common()->Merge(2), inner_if_true, inner_if_false); in TEST_F() 63 graph()->NewNode(common()->Merge(2), inner_merge, outer_if_false); in TEST_F() 98 graph()->NewNode(common()->Merge(2), inner_if_true, inner_if_false); in TEST_F() 104 graph()->NewNode(common()->Merge(2), outer_if_true, inner_merge); in TEST_F() 132 Node* merge1 = graph()->NewNode(common()->Merge(2), if_true1, if_false1); in TEST_F() 140 Node* merge2 = graph()->NewNode(common()->Merge(2), if_true2, if_false2); in TEST_F() 190 graph()->NewNode(common()->Merge(2), loop, outer_if_false); in TEST_F()
|
D | control-flow-optimizer-unittest.cc | 56 graph()->NewNode(common()->Merge(3), if_true0, if_true1, if_false1); in TEST_F() 87 graph()->NewNode(common()->Merge(3), if_true0, if_true1, if_false1); in TEST_F() 107 Node* merge0 = graph()->NewNode(common()->Merge(2), control1, control2); in TEST_F() 113 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in TEST_F()
|
D | common-operator-reducer-unittest.cc | 207 Reduce(graph()->NewNode(common()->Merge(2), if_true, if_false)); in TEST_F() 221 Reduce(graph()->NewNode(common()->Merge(2), if_false, if_true)); in TEST_F() 241 Node* const merge = graph()->NewNode(common()->Merge(value_input_count), in TEST_F() 287 Node* const merge = graph()->NewNode(common()->Merge(value_input_count), in TEST_F() 330 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in TEST_F() 350 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in TEST_F() 368 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in TEST_F() 386 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in TEST_F() 404 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in TEST_F() 422 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in TEST_F() [all …]
|
D | scheduler-unittest.cc | 662 Node* m = graph->NewNode(common->Merge(2), t, f); in CreateDiamond() 740 Node* m1 = graph()->NewNode(common()->Merge(2), t1, f1); in TARGET_TEST_F() 747 Node* m = graph()->NewNode(common()->Merge(2), t, f); in TARGET_TEST_F() 772 Node* mA1 = graph()->NewNode(common()->Merge(2), tA1, fA1); in TARGET_TEST_F() 779 Node* mB1 = graph()->NewNode(common()->Merge(2), tB1, fB1); in TARGET_TEST_F() 786 Node* mA2 = graph()->NewNode(common()->Merge(2), tA2, fA2); in TARGET_TEST_F() 793 Node* mB2 = graph()->NewNode(common()->Merge(2), tB2, fB2); in TARGET_TEST_F() 830 Node* m = graph()->NewNode(common()->Merge(2), t, f1); in TARGET_TEST_F() 862 Node* m1 = graph()->NewNode(common()->Merge(2), t1, f1); in TARGET_TEST_F() 892 Node* m1 = graph()->NewNode(common()->Merge(2), t1, f1); in TARGET_TEST_F() [all …]
|
D | live-range-unittest.cc | 291 original->Merge(splinter, zone()); in TEST_F() 321 original->Merge(splinter, zone()); in TEST_F() 358 original->Merge(splinter, zone()); in TEST_F() 406 original->Merge(splinter, zone()); in TEST_F() 422 original->Merge(splinter, zone()); in TEST_F() 458 vreg->Merge(splinter, zone()); in TEST_F()
|
D | node-matchers-unittest.cc | 833 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in TEST_F() 839 EXPECT_EQ(merge, matcher.Merge()); in TEST_F() 846 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in TEST_F() 852 EXPECT_EQ(merge, matcher.Merge()); in TEST_F() 859 Node* merge = graph()->NewNode(common()->Merge(2), if_false, if_true); in TEST_F() 865 EXPECT_EQ(merge, matcher.Merge()); in TEST_F() 877 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_value); in TEST_F() 886 Node* merge = graph()->NewNode(common()->Merge(2), if_false, if_value); in TEST_F() 895 Node* merge = graph()->NewNode(common()->Merge(2), if_true, if_false); in TEST_F() 901 EXPECT_EQ(merge, matcher.Merge()); in TEST_F() [all …]
|
/external/protobuf/src/google/protobuf/ |
D | reflection_ops_unittest.cc | 93 TEST(ReflectionOpsTest, Merge) { in TEST() argument 115 ReflectionOps::Merge(message2, &message); in TEST() 145 ReflectionOps::Merge(message2, &message); in TEST() 156 ReflectionOps::Merge(message2, &message1); in TEST() 172 ReflectionOps::Merge(message1, &message2); in TEST() 176 ReflectionOps::Merge(message1, &message2); in TEST() 181 ReflectionOps::Merge(message1, &message2); in TEST() 194 ReflectionOps::Merge(message, &message), in TEST()
|
/external/snakeyaml/src/test/resources/pyyaml/ |
D | construct-merge.data | 15 - # Merge one map 20 - # Merge multiple maps
|
/external/llvm/test/YAMLParser/ |
D | construct-merge.test | 17 - # Merge one map 22 - # Merge multiple maps
|
/external/v8/src/crankshaft/ |
D | hydrogen-removable-simulates.cc | 87 static State* Merge(State* succ_state, in Merge() function in v8::internal::State 94 : succ_state->Merge(succ_block, pred_state, pred_block, zone); in Merge() 148 State* Merge(HBasicBlock* succ_block, in Merge() function in v8::internal::State
|
/external/autotest/site_utils/suite_scheduler/ |
D | build_event.py | 31 def Merge(self, to_merge): member in BuildEvent 39 super(BuildEvent, self).Merge(to_merge)
|
/external/llvm/test/tools/llvm-profdata/ |
D | overflow-instr.test | 3 1- Merge profile having maximum counts with itself and verify overflow detected and saturation occu… 11 2- Merge profile having maximum counts by itself and verify no overflow
|
/external/llvm/lib/Transforms/ObjCARC/ |
D | PtrState.h | 95 bool Merge(const RRInfo &Other); 154 void Merge(const PtrState &Other, bool TopDown);
|
D | PtrState.cpp | 91 bool RRInfo::Merge(const RRInfo &Other) { in Merge() function in RRInfo 138 void PtrState::Merge(const PtrState &Other, bool TopDown) { in Merge() function in PtrState 157 Partial = RRI.Merge(Other.RRI); in Merge()
|
/external/llvm/lib/Analysis/ |
D | TypeBasedAliasAnalysis.cpp | 459 void Instruction::getAAMetadata(AAMDNodes &N, bool Merge) const { in getAAMetadata() 460 if (Merge) in getAAMetadata() 466 if (Merge) in getAAMetadata() 472 if (Merge) in getAAMetadata()
|