Home
last modified time | relevance | path

Searched refs:NodeAt (Results 1 – 8 of 8) sorted by relevance

/external/webrtc/webrtc/modules/audio_processing/transient/
Dwpd_tree_unittest.cc46 ASSERT_TRUE(NULL != tree.NodeAt(level, i)); in TEST()
49 EXPECT_EQ(NULL, tree.NodeAt(level, -1)); in TEST()
50 EXPECT_EQ(NULL, tree.NodeAt(level, -12)); in TEST()
51 EXPECT_EQ(NULL, tree.NodeAt(level, nodes_at_level)); in TEST()
52 EXPECT_EQ(NULL, tree.NodeAt(level, nodes_at_level + 5)); in TEST()
55 EXPECT_EQ(NULL, tree.NodeAt(-1, 0)); in TEST()
56 EXPECT_EQ(NULL, tree.NodeAt(-12, 0)); in TEST()
57 EXPECT_EQ(NULL, tree.NodeAt(kLevels + 1, 0)); in TEST()
58 EXPECT_EQ(NULL, tree.NodeAt(kLevels + 5, 0)); in TEST()
173 const float* node_data = tree.NodeAt(kLevels, i)->data(); in TEST()
Dwpd_tree.h65 WPDNode* NodeAt(int level, int index);
Dwpd_tree.cc68 WPDNode* WPDTree::NodeAt(int level, int index) { in NodeAt() function in webrtc::WPDTree
Dtransient_detector.cc84 WPDNode* leaf = wpd_tree_->NodeAt(kLevels, i); in Detect()
/external/v8/src/compiler/
Dschedule.h84 Node* NodeAt(size_t index) { return nodes_[index]; } in NON_EXPORTED_BASE()
Dmachine-graph-verifier.cc90 i < block->NodeCount() ? block->NodeAt(i) : block->control_input(); in Run()
292 i < block->NodeCount() ? block->NodeAt(i) : block->control_input(); in Run()
Deffect-control-linearizer.cc98 Node* control = block->NodeAt(0); in UpdateBlockControl()
265 block->SuccessorAt(0)->NodeAt(0) == matcher.IfTrue() ? 0 : 1; in TryCloneBranch()
317 Node* control = block->NodeAt(instr); in Run()
335 Node* node = block->NodeAt(instr); in Run()
439 Node* node = block->NodeAt(instr); in Run()
Dverifier.cc1432 if (block->NodeAt(use_pos) == node) return true; in HasDominatingDef()
1653 Node* node = block->NodeAt(i); in Run()