Home
last modified time | relevance | path

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

12

/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/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/arm-trusted-firmware/lib/psci/
Dpsci_setup.c43 static void __init psci_init_pwr_domain_node(uint16_t node_idx, in psci_init_pwr_domain_node() argument
48 assert(node_idx < PSCI_NUM_NON_CPU_PWR_DOMAINS); in psci_init_pwr_domain_node()
50 psci_non_cpu_pd_nodes[node_idx].level = level; in psci_init_pwr_domain_node()
51 psci_lock_init(psci_non_cpu_pd_nodes, node_idx); in psci_init_pwr_domain_node()
52 psci_non_cpu_pd_nodes[node_idx].parent_node = parent_idx; in psci_init_pwr_domain_node()
53 psci_non_cpu_pd_nodes[node_idx].local_state = in psci_init_pwr_domain_node()
58 assert(node_idx < PLATFORM_CORE_COUNT); in psci_init_pwr_domain_node()
60 psci_cpu_pd_nodes[node_idx].parent_node = parent_idx; in psci_init_pwr_domain_node()
63 psci_cpu_pd_nodes[node_idx].mpidr = PSCI_INVALID_MPIDR; in psci_init_pwr_domain_node()
66 &(_cpu_data_by_index(node_idx)->psci_svc_cpu_data); in psci_init_pwr_domain_node()
[all …]
/external/arm-trusted-firmware/plat/xilinx/versal/pm_service/
Dpm_client.c135 enum pm_device_node_idx node_idx; in pm_client_set_wakeup_sources() local
144 node_idx = irq_to_pm_node_idx(irq); in pm_client_set_wakeup_sources()
147 if ((node_idx != XPM_NODEIDX_DEV_MIN) && in pm_client_set_wakeup_sources()
148 (!pm_wakeup_nodes_set[node_idx])) { in pm_client_set_wakeup_sources()
150 device_id = PERIPH_DEVID(node_idx); in pm_client_set_wakeup_sources()
153 pm_wakeup_nodes_set[node_idx] = !ret; in pm_client_set_wakeup_sources()
/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()
Dpattern_utils.h204 for (const auto& node_idx : remove_node_indices_) { in HasRemoveNodeExternalDependents() local
205 auto node_view = graph_view_->GetNode(node_idx); in HasRemoveNodeExternalDependents()
Dpattern_utils_test.cc433 for (auto const& node_idx : remove_node_indices) { in TEST_F() local
434 remove_node_names.push_back(graph_view.GetNode(node_idx)->GetName()); in TEST_F()
449 for (auto const& node_idx : remove_node_indices) { in TEST_F() local
450 mutation->RemoveNode(graph_view.GetNode(node_idx)); in TEST_F()
/external/tensorflow/tensorflow/core/grappler/optimizers/
Dauto_mixed_precision.cc423 const NodeTypeId* GetNode(int node_idx) const;
435 const absl::InlinedVector<int, 4>& GetFanin(int node_idx) const;
438 const absl::InlinedVector<int, 2>& GetFanout(int node_idx) const;
495 for (int node_idx = 0; node_idx < num_nodedefs; ++node_idx) { in InitializeFromGraph() local
496 const NodeDef& node = graph.node(node_idx); in InitializeFromGraph()
497 node_name_to_index_.emplace(node.name(), node_idx); in InitializeFromGraph()
633 const NodeTypeId* GraphTypeTopologyView::GetNode(int node_idx) const { in GetNode()
635 DCHECK(node_idx >= 0 && node_idx < num_nodes_) << "node_idx is out of range"; in GetNode()
636 return &node_type_attrs_.at(node_idx); in GetNode()
656 int node_idx) const { in GetFanin()
[all …]
Ddependency_optimizer.cc246 void DependencyOptimizer::OptimizeNode(int node_idx, in OptimizeNode() argument
249 NodeDef* node = optimized_graph_->mutable_node(node_idx); in OptimizeNode()
451 nodes_to_delete->insert(node_idx); in OptimizeNode()
539 for (int node_idx = 0; node_idx < num_nodes; ++node_idx) { in TransitiveReduction() local
540 const NodeDef& node = optimized_graph_->node(node_idx); in TransitiveReduction()
554 outputs[input_node_idx].push_back(node_idx); in TransitiveReduction()
556 std::min(target_range[input_node_idx].first, node_idx); in TransitiveReduction()
559 control_outputs[input_node_idx].emplace_back(node_idx, input_slot); in TransitiveReduction()
561 std::max(target_range[input_node_idx].second, node_idx); in TransitiveReduction()
Ddependency_optimizer.h66 void OptimizeNode(int node_idx, SetVector<int>* nodes_to_simplify,
Dloop_optimizer.cc524 for (int node_idx = 0; node_idx < optimized_graph->node_size(); ++node_idx) { in RemoveStackOps() local
525 if (IsStackOp(optimized_graph->node(node_idx))) { in RemoveStackOps()
527 graph_view, nodes_to_preserve, node_idx)) { in RemoveStackOps()
/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/lite/delegates/coreml/builders/
Dtest_util.mm57 for (int node_idx : interpreter->execution_plan()) {
60 const auto* node_and_reg = interpreter->node_and_registration(node_idx);
/external/adhd/cras/src/server/
Dcras_iodev_list.c116 unsigned int node_idx) in find_node() argument
119 DL_SEARCH_SCALAR(iodev->nodes, node, idx, node_idx); in find_node()
1621 static int set_node_plugged(struct cras_iodev *iodev, unsigned int node_idx, in set_node_plugged() argument
1626 node = find_node(iodev, node_idx); in set_node_plugged()
1633 static int set_node_volume(struct cras_iodev *iodev, unsigned int node_idx, in set_node_volume() argument
1638 node = find_node(iodev, node_idx); in set_node_volume()
1656 unsigned int node_idx, int value) in set_node_capture_gain() argument
1661 node = find_node(iodev, node_idx); in set_node_capture_gain()
1686 unsigned int node_idx, in set_node_left_right_swapped() argument
1694 node = find_node(iodev, node_idx); in set_node_left_right_swapped()
Dcras_hfp_alsa_iodev.c170 unsigned node_idx, unsigned dev_enabled) in hfp_alsa_update_active_node() argument
175 aio->update_active_node(aio, node_idx, dev_enabled); in hfp_alsa_update_active_node()
Dcras_empty_iodev.c162 static void update_active_node(struct cras_iodev *iodev, unsigned node_idx, in update_active_node() argument
/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/tensorflow/tensorflow/lite/micro/
Dmicro_allocator.cc329 current->first_created = current_request->node_idx; in AddScratchBuffers()
330 current->last_used = current_request->node_idx; in AddScratchBuffers()
689 if (requests[i].node_idx == kUnassignedScratchBufferRequestIndex) { in RequestScratchBufferInArena()
710 current_request->node_idx = kUnassignedScratchBufferRequestIndex; in RequestScratchBufferInArena()
734 if (requests[i].node_idx == kUnassignedScratchBufferRequestIndex) { in FinishPrepareNodeAllocations()
735 requests[i].node_idx = node_id; in FinishPrepareNodeAllocations()
Dmicro_allocator.h60 int node_idx; member
/external/icing/icing/legacy/index/
Dicing-dynamic-trie.h533 uint32_t node_idx; member
536 explicit Branch(uint32_t ni) : node_idx(ni), child_idx(0) {} in Branch()
/external/adhd/cras/src/libcras/
Dcras_client.h1345 int (*get_node_idx)(struct cras_node_info *node, uint32_t *node_idx);
1907 uint32_t *node_idx) in libcras_node_info_get_node_idx() argument
1909 return node->get_node_idx(node->node_, node_idx); in libcras_node_info_get_node_idx()
/external/tensorflow/tensorflow/lite/kernels/
Dtest_util.cc330 for (int node_idx : interpreter->execution_plan()) { in CountPartitionsExecutedByCpuKernel() local
333 std::tie(node, reg) = *(interpreter->node_and_registration(node_idx)); in CountPartitionsExecutedByCpuKernel()

12