Home
last modified time | relevance | path

Searched refs:node_idx (Results 1 – 25 of 29) sorted by relevance

12

/external/libaom/libaom/tools/txfm_analyzer/
Dtxfm_graph.cc183 int node_idx, int in, double w) { in add_node() argument
184 int outIdx = get_idx(stage_idx, node_idx, node_num); in add_node()
199 int node_idx, int in0, double w0, int in1, double w1) { in connect_node() argument
200 int outIdx = get_idx(stage_idx, node_idx, node_num); in connect_node()
265 int node_idx, int estimate_bit) { in estimate_value() argument
267 int outIdx = get_idx(stage_idx, node_idx, node_num); in estimate_value()
280 int node_idx, int amplify_bit) { in amplify_value() argument
281 int outIdx = get_idx(stage_idx, node_idx, node_num); in amplify_value()
310 int node_idx, int N, int star) { in gen_B_graph() argument
312 int out = node_idx + i; in gen_B_graph()
[all …]
Dtxfm_graph.h55 int node_idx, int in0, double w0, int in1, double w1);
60 int node_idx, int N, int star);
62 int node_idx, int N);
65 int node_idx, int N);
67 int node_idx, int N);
69 int node_idx, int idx, int N);
71 int node_idx, int idx, int N);
74 int node_idx, int N);
77 int node_idx, int N);
80 int node_idx, int dct_node_num);
[all …]
/external/tensorflow/tensorflow/core/grappler/
Dgraph_topology_view.cc57 for (int node_idx = 0; node_idx < num_nodes_; ++node_idx) { in InitializeFromGraph() local
58 const NodeDef& node = graph.node(node_idx); in InitializeFromGraph()
59 node_name_to_index_.emplace(node.name(), node_idx); in InitializeFromGraph()
102 for (int node_idx = 0; node_idx < num_nodes_; ++node_idx) { in InitializeFromGraph() local
103 const NodeDef& node = graph.node(node_idx); in InitializeFromGraph()
104 fanins_[node_idx].reserve(node.input_size()); in InitializeFromGraph()
126 fanins_[node_idx].push_back(input_idx); in InitializeFromGraph()
127 fanouts_[input_idx].push_back(node_idx); in InitializeFromGraph()
132 SortAndRemoveDuplicates(&fanins_[node_idx]); in InitializeFromGraph()
136 for (int node_idx = 0; node_idx < num_nodes_; ++node_idx) { in InitializeFromGraph() local
[all …]
Dgraph_topology_view.h76 const NodeDef* GetNode(int node_idx) const;
87 const absl::InlinedVector<int, 4>& GetFanin(int node_idx) const;
90 const absl::InlinedVector<int, 2>& GetFanout(int node_idx) const;
/external/tensorflow/tensorflow/core/grappler/utils/
Dtraversal.cc54 const absl::optional<int> node_idx = graph_view.GetNodeIndex(*node); in DfsTraversal() local
55 DCHECK(node_idx.has_value()) << "Illegal start node: " << node->name(); in DfsTraversal()
56 if (node_idx.has_value()) { in DfsTraversal()
57 stack.emplace_back(node_idx.value()); in DfsTraversal()
/external/tensorflow/tensorflow/core/example/
Dexample_parser_configuration.cc33 const string& node_name, int* node_idx) { in FindNodeIndexByName() argument
37 *node_idx = i; in FindNodeIndexByName()
49 int node_idx; in ExtractExampleParserConfiguration() local
50 TF_RETURN_IF_ERROR(FindNodeIndexByName(graph, node_name, &node_idx)); in ExtractExampleParserConfiguration()
52 const auto& node = graph.node(node_idx); in ExtractExampleParserConfiguration()
/external/tensorflow/tensorflow/core/grappler/optimizers/
Ddependency_optimizer.cc224 void DependencyOptimizer::OptimizeNode(int node_idx, in OptimizeNode() argument
227 NodeDef* node = optimized_graph_->mutable_node(node_idx); in OptimizeNode()
428 nodes_to_delete->insert(node_idx); in OptimizeNode()
482 for (int node_idx = 0; node_idx < num_nodes; ++node_idx) { in TransitiveReduction() local
483 const NodeDef& node = optimized_graph_->node(node_idx); in TransitiveReduction()
497 inputs[node_idx].push_back(input_node_idx); in TransitiveReduction()
500 control_outputs[input_node_idx].emplace_back(node_idx, input_slot); in TransitiveReduction()
Ddependency_optimizer.h64 void OptimizeNode(int node_idx, SetVector<int>* nodes_to_simplify,
Dloop_optimizer.cc525 for (int node_idx = 0; node_idx < optimized_graph->node_size(); ++node_idx) { in RemoveStackOps() local
526 if (IsStackOp(optimized_graph->node(node_idx))) { in RemoveStackOps()
528 graph_view, nodes_to_preserve, node_idx)) { in RemoveStackOps()
Dfunction_optimizer.cc1853 absl::optional<int> node_idx = placed_topo_view.GetNodeIndex(inlined_node); in InlineIndirectFunctionCall() local
1867 placed_graph_def.mutable_node(*node_idx)->add_input( in InlineIndirectFunctionCall()
1875 absl::optional<int> node_idx = placed_topo_view.GetNodeIndex(inlined_node); in InlineIndirectFunctionCall() local
1879 placed_graph_def.mutable_node(*node_idx)->add_input( in InlineIndirectFunctionCall()
/external/tensorflow/tensorflow/contrib/boosted_trees/estimator_batch/
Dcustom_export_strategy.py135 for node_idx in range(len(gtflow_tree.nodes)):
136 gtflow_node = gtflow_tree.nodes[node_idx]
139 node.node_id.value = node_idx
/external/skqp/src/compute/skc/platforms/cl_12/kernels/
Dfills_expand.cl275 skc_uint node_idx = id * SKC_FILLS_EXPAND_ELEMS_PER_SUBBLOCK + get_sub_group_local_id();
282 union skc_path_elem const n##I = blocks[node_idx + I * SKC_FILLS_EXPAND_SUBGROUP_SIZE];
292 node_idx + I * SKC_FILLS_EXPAND_SUBGROUP_SIZE);
Dpaths_reclaim.cl314 skc_uint const node_idx = id * SKC_DEVICE_SUBBLOCK_WORDS + get_sub_group_local_id();
321 skc_uint n##I = bp_elems[node_idx + I * SKC_PATHS_RECLAIM_SUBGROUP_SIZE];
/external/skia/src/compute/skc/platforms/cl_12/kernels/
Dfills_expand.cl275 skc_uint node_idx = id * SKC_FILLS_EXPAND_ELEMS_PER_SUBBLOCK + get_sub_group_local_id();
282 union skc_path_elem const n##I = blocks[node_idx + I * SKC_FILLS_EXPAND_SUBGROUP_SIZE];
292 node_idx + I * SKC_FILLS_EXPAND_SUBGROUP_SIZE);
Dpaths_reclaim.cl314 skc_uint const node_idx = id * SKC_DEVICE_SUBBLOCK_WORDS + get_sub_group_local_id();
321 skc_uint n##I = bp_elems[node_idx + I * SKC_PATHS_RECLAIM_SUBGROUP_SIZE];
/external/tensorflow/tensorflow/contrib/boosted_trees/kernels/
Dtraining_ops.cc855 for (size_t node_idx = 0; node_idx < tree_nodes.size(); ++node_idx) { in PruneTree() local
857 auto& original_node = tree_nodes[node_idx]; in PruneTree()
863 auto mapped_node_it = nodes_map.find(node_idx); in PruneTree()
/external/adhd/cras/src/server/
Dcras_empty_iodev.c173 static void update_active_node(struct cras_iodev *iodev, unsigned node_idx, in update_active_node() argument
Dtest_iodev.c151 static void update_active_node(struct cras_iodev *iodev, unsigned node_idx, in update_active_node() argument
Dcras_hfp_iodev.c194 static void update_active_node(struct cras_iodev *iodev, unsigned node_idx, in update_active_node() argument
Dcras_iodev.h219 unsigned node_idx, unsigned dev_enabled);
Dcras_loopback_iodev.c234 static void update_active_node(struct cras_iodev *iodev, unsigned node_idx, in update_active_node() argument
Dcras_a2dp_iodev.c425 static void update_active_node(struct cras_iodev *iodev, unsigned node_idx, in update_active_node() argument
Dcras_bt_io.c290 static void update_active_node(struct cras_iodev *iodev, unsigned node_idx, in update_active_node() argument
/external/adhd/cras/src/tests/
Dbt_device_unittest.cc65 unsigned node_idx, in update_active_node() argument
Diodev_list_unittest.cc93 unsigned node_idx, in dummy_update_active_node() argument
239 unsigned node_idx, in update_active_node() argument
243 update_active_node_node_idx_val[i] = node_idx; in update_active_node()

12