Home
last modified time | relevance | path

Searched refs:node_id (Results 1 – 25 of 120) sorted by relevance

12345

/external/tensorflow/tensorflow/contrib/tensor_forest/kernels/v4/
Dsplit_collection_operators.cc44 int32 node_id, int32 depth) const { in CreateGrowStats() argument
72 stats_[slot.node_id()] = CreateGrowStats(slot.node_id(), slot.depth()); in ExtractFromProto()
73 stats_[slot.node_id()]->ExtractFromProto(slot); in ExtractFromProto()
88 void SplitCollectionOperator::InitializeSlot(int32 node_id, int32 depth) { in InitializeSlot() argument
89 stats_[node_id] = std::unique_ptr<GrowStats>(CreateGrowStats(node_id, depth)); in InitializeSlot()
90 stats_[node_id]->Initialize(); in InitializeSlot()
95 const std::vector<int>& examples, int32 node_id) const { in AddExample()
96 auto* slot = stats_.at(node_id).get(); in AddExample()
102 bool SplitCollectionOperator::IsInitialized(int32 node_id) const { in IsInitialized()
103 auto it = stats_.find(node_id); in IsInitialized()
[all …]
Dgraph_collection_operator.cc28 int32 node_id, int32 depth) const { in CreateGrowStats() argument
32 int64 GraphRunnerSplitCollectionOperator::UniqueId(int32 node_id, in UniqueId() argument
34 return node_id * num_splits_to_consider_ + split_id; in UniqueId()
37 bool GraphRunnerSplitCollectionOperator::BestSplit(int32 node_id, in BestSplit() argument
42 auto* slot = stats_.at(node_id).get(); in BestSplit()
46 auto& runner = runners_[UniqueId(node_id, i)]; in BestSplit()
61 auto& runner = runners_[UniqueId(node_id, best_index)]; in BestSplit()
70 const std::vector<int>& examples, int32 node_id) const { in AddExample()
85 auto* slot = stats_.at(node_id).get(); in AddExample()
87 auto& runner = runners_[UniqueId(node_id, i)]; in AddExample()
[all …]
Dfertile-stats-resource.cc24 const std::vector<int>& examples, int32 node_id, bool* is_finished) { in AddExampleToStatsAndInitialize() argument
26 if (collection_op_->IsInitialized(node_id)) { in AddExampleToStatsAndInitialize()
27 collection_op_->AddExample(input_data, target, examples, node_id); in AddExampleToStatsAndInitialize()
33 input_data, target, example, node_id); in AddExampleToStatsAndInitialize()
34 if (collection_op_->IsInitialized(node_id)) { in AddExampleToStatsAndInitialize()
40 *is_finished = collection_op_->IsFinished(node_id); in AddExampleToStatsAndInitialize()
43 void FertileStatsResource::AllocateNode(int32 node_id, int32 depth) { in AllocateNode() argument
44 collection_op_->InitializeSlot(node_id, depth); in AllocateNode()
59 bool FertileStatsResource::BestSplit(int32 node_id, SplitCandidate* best, in BestSplit() argument
61 return collection_op_->BestSplit(node_id, best, depth); in BestSplit()
Dsplit_collection_operators.h41 virtual std::unique_ptr<GrowStats> CreateGrowStats(int32 node_id,
55 int32 node_id) const;
60 const InputTarget* target, int example, int32 node_id) const;
63 virtual void InitializeSlot(int32 node_id, int32 depth);
74 virtual void ClearSlot(int32 node_id) { stats_.erase(node_id); } in ClearSlot() argument
77 virtual bool IsInitialized(int32 node_id) const;
80 virtual bool IsFinished(int32 node_id) const { in IsFinished() argument
81 return stats_.at(node_id)->IsFinished(); in IsFinished()
86 virtual bool BestSplit(int32 node_id, SplitCandidate* best,
Dgraph_collection_operator.h48 std::unique_ptr<GrowStats> CreateGrowStats(int32 node_id,
55 int32 node_id) const override;
60 const InputTarget* target, int example, int32 node_id) const override;
62 bool BestSplit(int32 node_id, SplitCandidate* best,
65 void ClearSlot(int32 node_id) override;
68 int64 UniqueId(int32 node_id, int32 split_id) const;
Dfertile-stats-resource.h54 void ResetSplitStats(int32 node_id, int32 depth) { in ResetSplitStats() argument
55 collection_op_->ClearSlot(node_id); in ResetSplitStats()
56 collection_op_->InitializeSlot(node_id, depth); in ResetSplitStats()
70 int32 node_id, bool* is_finished);
82 bool BestSplit(int32 node_id, SplitCandidate* best, int32* depth);
90 void AllocateNode(int32 node_id, int32 depth);
/external/google-fruit/extras/benchmark/
Dno_di_library_source_generator.py20 for node_id in injection_graph.nodes_iter():
21 deps = injection_graph.successors(node_id)
23 … file_content_by_name['class%s_interface.h' % node_id] = _generate_class_interface_header(node_id)
24 …file_content_by_name['class%s.h' % node_id] = _generate_class_header_with_interfaces(node_id, deps)
25 …file_content_by_name['class%s.cpp' % node_id] = _generate_class_cpp_file_with_interfaces(node_id, …
27 …file_content_by_name['class%s.h' % node_id] = _generate_class_header_without_interfaces(node_id, d…
28 …file_content_by_name['class%s.cpp' % node_id] = _generate_class_cpp_file_without_interfaces(node_i…
149 [toplevel_class_index] = [node_id
150 for node_id in injection_graph.nodes_iter()
151 if not injection_graph.predecessors(node_id)]
Dboost_di_source_generator.py18 for node_id in injection_graph.nodes_iter():
19 deps = injection_graph.successors(node_id)
20 file_content_by_name['component%s.h' % node_id] = _generate_component_header(node_id, deps)
21 … file_content_by_name['component%s.cpp' % node_id] = _generate_component_source(node_id, deps)
23 [toplevel_node] = [node_id
24 for node_id in injection_graph.nodes_iter()
25 if not injection_graph.predecessors(node_id)]
Dfruit_source_generator.py22 for node_id in injection_graph.nodes_iter():
23 file_content_by_name['component%s.h' % node_id] = _generate_component_header(node_id)
24 …content_by_name['component%s.cpp' % node_id] = _generate_component_source(node_id, injection_graph…
26 [toplevel_node] = [node_id
27 for node_id in injection_graph.nodes_iter()
28 if not injection_graph.predecessors(node_id)]
/external/tensorflow/tensorflow/core/kernels/boosted_trees/
Dprediction_ops.cc119 int32 node_id = cached_node_ids(i); in Compute() local
122 if (node_id >= 0) { in Compute()
126 resource->GetPostPruneCorrection(tree_id, node_id, &node_id, in Compute()
131 const auto& node_logits = resource->node_value(tree_id, node_id); in Compute()
136 node_id = 0; in Compute()
140 if (resource->is_leaf(tree_id, node_id)) { in Compute()
141 const auto& leaf_logits = resource->node_value(tree_id, node_id); in Compute()
155 node_id = 0; in Compute()
157 node_id = resource->next_node(tree_id, node_id, i, in Compute()
161 output_node_ids(i) = node_id; in Compute()
[all …]
Dresources.cc54 const int32 tree_id, const int32 node_id, const int32 index_in_batch, in next_node() argument
57 DCHECK_LT(node_id, tree_ensemble_->trees(tree_id).nodes_size()); in next_node()
58 const auto& node = tree_ensemble_->trees(tree_id).nodes(node_id); in next_node()
82 const int32 tree_id, const int32 node_id) const { in node_value()
84 DCHECK_LT(node_id, tree_ensemble_->trees(tree_id).nodes_size()); in node_value()
85 const auto& node = tree_ensemble_->trees(tree_id).nodes(node_id); in node_value()
117 const int32 node_id, in set_node_value() argument
120 DCHECK_LT(node_id, tree_ensemble_->trees(tree_id).nodes_size()); in set_node_value()
121 auto* node = tree_ensemble_->mutable_trees(tree_id)->mutable_nodes(node_id); in set_node_value()
164 const int32 node_id) const { in is_leaf()
[all …]
Dresources.h68 const int32 tree_id, const int32 node_id, const int32 index_in_batch,
71 std::vector<float> node_value(const int32 tree_id, const int32 node_id) const;
73 void set_node_value(const int32 tree_id, const int32 node_id,
92 bool is_leaf(const int32 tree_id, const int32 node_id) const;
94 int32 feature_id(const int32 tree_id, const int32 node_id) const;
96 int32 bucket_threshold(const int32 tree_id, const int32 node_id) const;
98 int32 left_id(const int32 tree_id, const int32 node_id) const;
100 int32 right_id(const int32 tree_id, const int32 node_id) const;
109 void AddBucketizedSplitNode(const int32 tree_id, const int32 node_id,
149 bool IsTerminalSplitNode(const int32 tree_id, const int32 node_id) const;
[all …]
/external/adhd/cras/src/common/
Dcras_messages.h255 cras_node_id_t node_id; member
261 cras_node_id_t node_id, in cras_fill_set_node_attr() argument
266 m->node_id = node_id; in cras_fill_set_node_attr()
276 cras_node_id_t node_id; member
281 cras_node_id_t node_id) in cras_fill_select_node() argument
285 m->node_id = node_id; in cras_fill_select_node()
293 cras_node_id_t node_id; member
298 cras_node_id_t node_id) in cras_fill_add_active_node() argument
302 m->node_id = node_id; in cras_fill_add_active_node()
310 cras_node_id_t node_id; member
[all …]
/external/adhd/cras/src/tests/
Dcras_monitor.c68 cras_node_id_t node_id) in node_array_index_of_node_id() argument
70 uint32_t dev_index = dev_index_of(node_id); in node_array_index_of_node_id()
71 uint32_t node_index = node_index_of(node_id); in node_array_index_of_node_id()
84 cras_node_id_t node_id) in node_name_for_node_id() argument
90 uint32_t iodev_idx = dev_index_of(node_id); in node_name_for_node_id()
95 if (node_id == 0) { in node_name_for_node_id()
101 string_for_direction(dir), node_id); in node_name_for_node_id()
117 iodev_idx, node_index_of(node_id)); in node_name_for_node_id()
120 node_index = node_array_index_of_node_id(nodes, num_nodes, node_id); in node_name_for_node_id()
134 cras_node_id_t node_id) in active_node_changed() argument
[all …]
Dobserver_unittest.cc144 cras_node_id_t node_id) { in cb_active_node_changed() argument
148 cb_active_node_changed_node_id.push_back(node_id); in cb_active_node_changed()
153 cras_node_id_t node_id, in cb_output_node_volume_changed() argument
157 cb_output_node_volume_changed_node_id.push_back(node_id); in cb_output_node_volume_changed()
163 cras_node_id_t node_id, in cb_node_left_right_swapped_changed() argument
167 cb_node_left_right_swapped_changed_node_id.push_back(node_id); in cb_node_left_right_swapped_changed()
173 cras_node_id_t node_id, in cb_input_node_gain_changed() argument
177 cb_input_node_gain_changed_node_id.push_back(node_id); in cb_input_node_gain_changed()
423 const cras_node_id_t node_id = 0x0001000100020002; in TEST_F() local
425 cras_observer_notify_active_node(dir, node_id); in TEST_F()
[all …]
/external/autotest/client/cros/audio/
Dcras_utils.py173 def set_node_volume(node_id, volume): argument
180 get_cras_control_interface().SetOutputNodeVolume(node_id, volume)
252 for node_id in selected_output_node_ids:
253 set_node_volume(node_id, volume)
518 def set_active_input_node(node_id): argument
524 get_cras_control_interface().SetActiveInputNode(node_id)
527 def set_active_output_node(node_id): argument
533 get_cras_control_interface().SetActiveOutputNode(node_id)
536 def add_active_output_node(node_id): argument
542 get_cras_control_interface().AddActiveOutputNode(node_id)
[all …]
/external/tensorflow/tensorflow/python/saved_model/
Dload.py99 self._get_tensor_from_node(node_id)
100 for node_id in proto.bound_inputs]
102 self._nodes[node_id]
103 for node_id in proto.bound_inputs
104 if self._proto.nodes[node_id].WhichOneof("kind") == "variable"
112 def _get_tensor_from_node(self, node_id): argument
115 obj = self._nodes[node_id]
143 for node_id, proto in enumerate(self._proto.nodes):
144 if node_id in slot_variable_node_ids:
149 nodes[node_id] = node
[all …]
/external/ltp/testcases/kernel/syscalls/getcpu/
Dgetcpu01.c23 unsigned *node_id LTP_ATTRIBUTE_UNUSED, in get_cpu()
27 return syscall(__NR_getcpu, cpu_id, node_id, cache_struct); in get_cpu()
87 int node_id = 0; in get_nodeid() local
110 node_id = in get_nodeid()
119 return node_id; in get_nodeid()
125 unsigned int cpu_id, node_id = 0; in run() local
136 TEST(get_cpu(&cpu_id, &node_id, NULL)); in run()
143 else if (node_id != node_set) in run()
146 node_set, node_id); in run()
151 node_id); in run()
/external/tensorflow/tensorflow/contrib/checkpoint/python/
Dvisualize.py64 for node_id, node in enumerate(object_graph.nodes):
67 if node_id in slot_ids:
76 node_id,
84 'tooltip="Optimizer"]\n') % node_id
86 graph += 'N_%d [shape=point label="" width=.25]\n' % node_id
89 node_id, reference.node_id, _escape(reference.local_name))
92 node_id,
/external/tensorflow/tensorflow/contrib/boosted_trees/lib/trees/
Ddecision_tree.cc32 int32 node_id = sub_root_id; in Traverse() local
36 const auto& current_node = config.nodes(node_id); in Traverse()
39 return node_id + oblivious_leaf_idx; in Traverse()
43 node_id = example.dense_float_features[split.feature_column()] <= in Traverse()
58 node_id = !sparse_feature[dimension_id].has_value() || in Traverse()
73 node_id = sparse_feature[dimension_id].has_value() && in Traverse()
84 node_id = (std::find(features.begin(), features.end(), in Traverse()
94 node_id = split.right_id(); in Traverse()
99 node_id = split.left_id(); in Traverse()
112 node_id++; in Traverse()
[all …]
/external/tensorflow/tensorflow/core/kernels/hexagon/
Dhexagon_control_wrapper.cc181 node_input.set_node_id(node_info->node_id()); in SetupGraph()
216 node_ids[i] = node_input.node_id() + NODE_ID_OFFSET; in SetupGraph()
220 const int node_id = input_params.node_id(); in SetupGraph() local
221 CHECK(inputs_map.count(node_id) == 0); in SetupGraph()
222 inputs_map.emplace(node_id, std::make_tuple(inputs_ptr, count)); in SetupGraph()
237 const int node_id = output_params.node_id(); in SetupGraph() local
238 CHECK(outputs_map.count(node_id) == 0); in SetupGraph()
239 outputs_map.emplace(node_id, std::make_tuple(outputs_ptr, count)); in SetupGraph()
249 const int node_id = params.node_id(); in SetupGraph() local
257 CHECK(dummy_const_data_.count(node_id) == 0); in SetupGraph()
[all …]
Dgraph_transferer.cc166 const int node_id = node_name_to_id_cache_map_.at(node_name); in LoadGraphFromProto() local
167 const Node* node = node_name_cache_list_.at(node_id); in LoadGraphFromProto()
245 input_map.emplace(input.node_id(), &input); in SortParams()
253 const int node_id = params.node_id(); in SortParams() local
256 output_node_ids.emplace_back(node_id); in SortParams()
260 dependency_map.emplace(std::piecewise_construct, std::make_tuple(node_id), in SortParams()
265 CHECK_EQ(input_map.count(node_id), 1); in SortParams()
267 input_map.at(node_id)->node_input()) { in SortParams()
268 dependency_map.at(node_id).emplace(node_input.node_id()); in SortParams()
305 const int node_id = node_name_cache_list_.size() - 1; in CacheNode() local
[all …]
/external/adhd/cras/src/libcras/
Dcras_client.h402 const cras_node_id_t node_id,
437 cras_node_id_t node_id,
451 cras_node_id_t node_id);
463 cras_node_id_t node_id);
475 cras_node_id_t node_id);
940 cras_node_id_t node_id,
951 cras_node_id_t node_id, int enable);
961 cras_node_id_t node_id,
1005 cras_node_id_t *node_id);
1057 cras_node_id_t node_id,
[all …]
/external/adhd/cras/src/server/
Dcras_observer.c56 cras_node_id_t node_id; member
60 cras_node_id_t node_id; member
65 cras_node_id_t node_id; member
182 node_data->node_id); in active_node_alert()
196 node_data->node_id, in output_node_volume_alert()
211 node_data->node_id, in node_left_right_swapped_alert()
226 node_data->node_id, in input_node_gain_alert()
488 cras_node_id_t node_id) in cras_observer_notify_active_node() argument
493 data.node_id = node_id; in cras_observer_notify_active_node()
498 void cras_observer_notify_output_node_volume(cras_node_id_t node_id, in cras_observer_notify_output_node_volume() argument
[all …]
/external/tensorflow/tensorflow/core/common_runtime/eager/
Deager_executor.cc65 tensorflow::Status EagerExecutor::WaitFor(tensorflow::uint64 node_id) { in WaitFor() argument
66 return WaitImpl(false, node_id); in WaitFor()
74 tensorflow::uint64 node_id) { in WaitImpl() argument
81 node_id = node_queue_.back()->id; in WaitImpl()
82 } else if (node_id < node_queue_.front()->id) { in WaitImpl()
87 node_done_notifications_.insert(std::make_pair(node_id, &cond)); in WaitImpl()
137 tensorflow::uint64 node_id = curr_node->id; in Run() local
141 const auto range = ok ? node_done_notifications_.equal_range(node_id) in Run()

12345