/external/dynamic_depth/internal/xmpmeta/xml/ |
D | search.cc | 49 const xmlNodePtr current_node = node_stack.top(); in DepthFirstSearch() local 51 if (strcmp(FromXmlChar(current_node->name), name) == 0) { in DepthFirstSearch() 53 return current_node; in DepthFirstSearch() 55 if (current_node->ns && current_node->ns->prefix && in DepthFirstSearch() 56 strcmp(FromXmlChar(current_node->ns->prefix), prefix) == 0) { in DepthFirstSearch() 57 return current_node; in DepthFirstSearch() 61 for (xmlNodePtr child = current_node->children; child != nullptr; in DepthFirstSearch()
|
/external/tensorflow/tensorflow/lite/testing/ |
D | message.cc | 38 Message* current_node = nodes_.top(); in ConsumeToken() local 45 nodes_.push(current_node ? current_node->AddChild(previous_token_) in ConsumeToken() 56 if (current_node) { in ConsumeToken() 57 current_node->Finish(); in ConsumeToken() 73 if (current_node) { in ConsumeToken() 74 current_node->SetField(previous_token_, *token); in ConsumeToken()
|
/external/tensorflow/tensorflow/lite/testing/nnapi_tflite_zip_tests/ |
D | message.cc | 41 Message* current_node = nodes_.top(); in ConsumeToken() local 48 nodes_.push(current_node ? current_node->AddChild(previous_token_) in ConsumeToken() 59 if (current_node) { in ConsumeToken() 60 current_node->Finish(); in ConsumeToken() 76 if (current_node) { in ConsumeToken() 77 current_node->SetField(previous_token_, *token); in ConsumeToken()
|
/external/tensorflow/tensorflow/contrib/boosted_trees/lib/trees/ |
D | decision_tree.cc | 36 const auto& current_node = config.nodes(node_id); in Traverse() local 37 switch (current_node.node_case()) { in Traverse() 42 const auto& split = current_node.dense_float_binary_split(); in Traverse() 51 current_node.sparse_float_binary_split_default_left().split(); in Traverse() 67 current_node.sparse_float_binary_split_default_right().split(); in Traverse() 81 const auto& split = current_node.categorical_id_binary_split(); in Traverse() 92 current_node.categorical_id_set_membership_binary_split(); in Traverse() 106 const auto& split = current_node.oblivious_dense_float_binary_split(); in Traverse() 117 current_node.oblivious_categorical_id_binary_split(); in Traverse() 129 LOG(QFATAL) << "Invalid node in tree: " << current_node.DebugString(); in Traverse() [all …]
|
/external/tensorflow/tensorflow/core/common_runtime/ |
D | eval_const_tensor.cc | 185 Node* current_node = current_edge->src(); in ExtractConstantSubgraph() local 188 if (current_node->op_def().is_stateful()) { in ExtractConstantSubgraph() 197 if (IsMerge(current_node)) { in ExtractConstantSubgraph() 204 if (IsEnter(current_node) || IsExit(current_node)) { in ExtractConstantSubgraph() 212 if (current_node->type_string() == "PlaceholderWithDefault") { in ExtractConstantSubgraph() 217 if (!HasCpuKernel(*current_node)) { in ExtractConstantSubgraph() 224 if (current_node->num_inputs() == 0) { in ExtractConstantSubgraph() 225 if (!current_node->IsConstant()) { in ExtractConstantSubgraph() 241 NodeAndRecursed* node_and_recursed = &old_to_new_and_recursed[current_node]; in ExtractConstantSubgraph() 244 current_node_copy = out_graph->CopyNode(current_node); in ExtractConstantSubgraph() [all …]
|
/external/mesa3d/src/gallium/drivers/r300/compiler/ |
D | r300_fragprog_emit.c | 50 unsigned current_node : 2; member 330 if (emit->current_node > 0) { in finish_node() 331 error("Node %i has no TEX instructions", emit->current_node); in finish_node() 337 if (emit->current_node == 0) in finish_node() 348 code->code_addr[emit->current_node] = in finish_node() 368 switch(emit->current_node) { in finish_node() 407 if (emit->current_node == 3) { in begin_tex() 415 emit->current_node++; in begin_tex() 513 code->config |= emit.current_node; /* FIRST_NODE_HAS_TEX set by finish_node */ in r300BuildFragmentProgramHwCode() 537 if (emit.current_node < 3) { in r300BuildFragmentProgramHwCode() [all …]
|
/external/v8/src/compiler/ |
D | escape-analysis.cc | 77 Node* current_node() const { return current_node_; } in current_node() function in v8::internal::compiler::ReduceScope 179 if (vobject) vobject->AddDependency(current_node()); in GetVirtualObject() 184 DCHECK_EQ(IrOpcode::kAllocate, current_node()->opcode()); in InitVirtualObject() 185 VirtualObject* vobject = tracker_->virtual_objects_.Get(current_node()); in InitVirtualObject() 191 if (vobject) vobject->AddDependency(current_node()); in InitVirtualObject() 205 current_node()->op()->mnemonic(), current_node()->id()); in SetEscaped() 214 NodeProperties::GetValueInput(current_node(), i)); in ValueInput() 218 NodeProperties::GetContextInput(current_node())); in ContextInput() 236 if (replacement_ != tracker_->replacements_[current_node()] || in ~Scope() 237 vobject_ != tracker_->virtual_objects_.Get(current_node())) { in ~Scope() [all …]
|
/external/tensorflow/tensorflow/compiler/tf2xla/ |
D | functionalize_control_flow_util.cc | 57 const Node* current_node = ready.back(); in CheckNodeNotInCycle() local 59 visited[current_node->id()] = true; in CheckNodeNotInCycle() 60 for (const Edge* out : current_node->out_edges()) { in CheckNodeNotInCycle()
|
/external/tensorflow/tensorflow/lite/python/ |
D | op_hint.py | 909 current_node = next_to_visit.pop() 910 visited.add(current_node) 911 if (current_node in reachable_by_input 912 and current_node not in input_nodes_set): 914 "Node %s uses input %s not in input_nodes." % (n, current_node)) 915 if current_node not in input_nodes_set: 917 input_node for input_node in name_to_input_name[current_node]
|
/external/tensorflow/tensorflow/tools/graph_transforms/ |
D | strip_unused_nodes.cc | 149 const NodeDef* current_node = node_lookup[current_input]; in StripUnusedNodes() local 150 for (const string& input_name : current_node->input()) { in StripUnusedNodes()
|
D | quantize_nodes.cc | 226 const NodeDef* current_node = hash_node_list[i]; in MergeDuplicateNodes() local 229 OpRegistry::Global()->LookUpOpDef(current_node->op(), &op_def)); in MergeDuplicateNodes() 233 inputs_to_rename[current_node->name() + ":*"] = original_name; in MergeDuplicateNodes() 237 *new_node = *current_node; in MergeDuplicateNodes()
|
/external/e2fsprogs/debugfs/ |
D | extent_cmds.ct | 8 current_node, current;
|
/external/tensorflow/tensorflow/contrib/boosted_trees/kernels/ |
D | training_ops.cc | 537 trees::TreeNode current_node = split_info.split_node(); in FindBestSplitOblivious() local 542 << "(current split: " << current_node.node_case() in FindBestSplitOblivious() 544 if (current_node.node_case() < best_node.node_case()) { in FindBestSplitOblivious() 546 } else if (current_node.node_case() == best_node.node_case()) { in FindBestSplitOblivious()
|
/external/tensorflow/tensorflow/core/grappler/optimizers/ |
D | layout_optimizer.cc | 1251 NodeDef* current_node = queue.front(); in IsNodeAfterNCHWToNHWC() local 1253 if (IsTransposeNCHWToNHWC(current_node->name()) || in IsNodeAfterNCHWToNHWC() 1254 IsDimMapNCHWToNHWC(current_node->name()) || in IsNodeAfterNCHWToNHWC() 1255 IsVecPermuteNCHWToNHWC(current_node->name())) { in IsNodeAfterNCHWToNHWC() 1260 if (ops_format_agnostic.find(current_node->op()) != in IsNodeAfterNCHWToNHWC() 1262 auto current_node_pos = DataInputPos(*current_node); in IsNodeAfterNCHWToNHWC() 1264 auto input_node = node_map_->GetNode(current_node->input(pos)); in IsNodeAfterNCHWToNHWC()
|
D | memory_optimizer.cc | 119 const NodeDef* current_node = to_visit.front(); in connected_subgraph() local 121 if (!expanded_nodes->insert(current_node).second) { in connected_subgraph() 127 for (const string& input_name_raw : current_node->input()) { in connected_subgraph() 136 for (const NodeDef* output : node_map.GetOutputs(current_node->name())) { in connected_subgraph()
|
/external/tensorflow/tensorflow/compiler/xla/service/ |
D | hlo_instruction.cc | 2728 HloInstruction* current_node = dfs_stack.back().second; in PostOrderDFS() local 2729 CHECK_GE(current_id, 0) << current_id << ": " << current_node in PostOrderDFS() 2735 VLOG(3) << "Not visiting HLO %" << current_node->name() in PostOrderDFS() 2743 TF_RETURN_IF_ERROR(visitor->Preprocess(current_node)); in PostOrderDFS() 2744 VLOG(2) << "Visiting HLO %" << current_node->name(); in PostOrderDFS() 2745 TF_RETURN_IF_ERROR(current_node->Visit(visitor)); in PostOrderDFS() 2747 TF_RETURN_IF_ERROR(visitor->Postprocess(current_node)); in PostOrderDFS() 2754 for (HloInstruction* child : current_node->operands()) { in PostOrderDFS() 2758 current_node->ToString()); in PostOrderDFS() 2763 for (HloInstruction* child : current_node->control_predecessors()) { in PostOrderDFS() [all …]
|