HomeSort by relevance Sort by last modified time
    Searched refs:parent_node (Results 1 - 13 of 13) sorted by null

  /external/tensorflow/tensorflow/contrib/boosted_trees/lib/trees/
decision_tree.h 39 TreeNode* parent_node);
decision_tree.cc 114 TreeNode* parent_node) {
117 switch (parent_node->node_case()) {
126 auto* split = parent_node->mutable_dense_float_binary_split();
135 parent_node->mutable_sparse_float_binary_split_default_left()
145 parent_node->mutable_sparse_float_binary_split_default_right()
154 auto* split = parent_node->mutable_categorical_id_binary_split();
163 parent_node->mutable_categorical_id_set_membership_binary_split();
  /device/linaro/bootloader/arm-trusted-firmware/lib/psci/
psci_common.c 291 parent_idx = psci_cpu_pd_nodes[plat_my_core_pos()].parent_node;
296 parent_idx = psci_non_cpu_pd_nodes[parent_idx].parent_node;
324 parent_idx = psci_cpu_pd_nodes[plat_my_core_pos()].parent_node;
329 parent_idx = psci_non_cpu_pd_nodes[parent_idx].parent_node;
341 unsigned int parent_node = psci_cpu_pd_nodes[cpu_idx].parent_node; local
345 *node_index++ = parent_node;
346 parent_node = psci_non_cpu_pd_nodes[parent_node].parent_node;
    [all...]
psci_stat.c 80 parent_idx = psci_cpu_pd_nodes[cpu_idx].parent_node;
94 parent_idx = psci_non_cpu_pd_nodes[parent_idx].parent_node;
131 parent_idx = psci_cpu_pd_nodes[cpu_idx].parent_node;
155 parent_idx = psci_non_cpu_pd_nodes[parent_idx].parent_node;
201 parent_idx = psci_cpu_pd_nodes[target_idx].parent_node;
203 parent_idx = psci_non_cpu_pd_nodes[parent_idx].parent_node;
psci_setup.c 42 psci_non_cpu_pd_nodes[node_idx].parent_node = parent_idx;
48 psci_cpu_pd_nodes[node_idx].parent_node = parent_idx;
psci_private.h 154 unsigned int parent_node; member in struct:non_cpu_pwr_domain_node
171 unsigned int parent_node; member in struct:cpu_pwr_domain_node
  /external/v8/src/compiler/
control-equivalence.cc 65 void ControlEquivalence::VisitPost(Node* node, Node* parent_node,
74 if (parent_node != nullptr) {
75 BracketList& parent_blist = GetBracketList(parent_node);
112 if (input != entry.parent_node) {
142 if (use != entry.parent_node) {
165 VisitPost(node, entry.parent_node, entry.direction);
control-equivalence.h 76 Node* parent_node; // Parent node of entry during DFS walk. member in struct:v8::internal::compiler::final::DFSStackEntry
102 void VisitPost(Node* node, Node* parent_node, DFSDirection direction);
  /external/iproute2/tc/
tc_class.c 33 struct graph_node *parent_node; member in struct:graph_node
187 while (node && node->parent_node) {
188 node->parent_node->right_node = node;
189 node = node->parent_node;
239 child->parent_node = cls;
  /external/mesa3d/src/compiler/nir/
nir_validate.c 85 nir_cf_node *parent_node; member in struct:__anon29339
657 validate_assert(state, block->cf_node.parent == state->parent_node);
723 switch (state->parent_node->type) {
735 nir_cf_node_as_block(nir_cf_node_next(state->parent_node));
785 nir_cf_node *old_parent = state->parent_node;
786 state->parent_node = &if_stmt->cf_node;
798 state->parent_node = old_parent;
815 nir_cf_node *old_parent = state->parent_node;
816 state->parent_node = &loop->cf_node;
825 state->parent_node = old_parent
    [all...]
  /external/selinux/libsepol/cil/test/unit/
test_cil_copy_ast.c 1449 struct cil_tree_node *parent_node; local
2184 struct cil_tree_node *parent_node; local
2217 struct cil_tree_node *parent_node; local
2251 struct cil_tree_node *parent_node; local
    [all...]
  /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
tree.rb 243 yield( parent_node = cursor.parent )
244 cursor = parent_node
271 yield( parent_node = cursor.parent )
272 cursor = parent_node
    [all...]
  /art/compiler/optimizing/
register_allocator_graph_color.cc 1323 InterferenceNode* parent_node = it->second; local
    [all...]

Completed in 471 milliseconds