Home
last modified time | relevance | path

Searched refs:left_node (Results 1 – 7 of 7) sorted by relevance

/third_party/mindspore/mindspore/ccsrc/frontend/parallel/auto_parallel/
Ddp_algo_costmodel.cc85 auto left_node = l_r_edge->prev_operator(); in GetStrategy() local
89 if (left_edge->next_operator() != left_node) { in GetStrategy()
183 auto left_node = elimination_tri->left_node_; in RecoverStrategy() local
188 …auto decision_tri = left_node->selected_cost()->decision_ptr_->cast<TriangleEliminationDecisionPtr… in RecoverStrategy()
195left_node->SetSelectedStrategyAndCost(decision_tri->left_node_strategy_, decision_tri->left_node_c… in RecoverStrategy()
Dgraph_costmodel.cc1346 auto left_node = edge_left_right->prev_operator(); in EliminationTriangle() local
1350 MS_EXCEPTION_IF_NULL(left_node); in EliminationTriangle()
1354 MS_LOG(INFO) << "The left operator is: " << left_node->name() << "."; in EliminationTriangle()
1357 if (left_edge->next_operator() != left_node) { in EliminationTriangle()
1364 for (auto &left_node_stra_cost : left_node->GetStrategyCost()) { in EliminationTriangle()
1402 return left_node; in EliminationTriangle()
/third_party/glib/glib/
Dgtree.c668 gboolean left_node = (bparent && node == bparent->left); in g_tree_insert_internal() local
676 else if (left_node) in g_tree_insert_internal()
685 if (left_node) in g_tree_insert_internal()
771 gboolean left_node; in g_tree_remove_internal() local
811 left_node = (parent && node == parent->left); in g_tree_remove_internal()
819 else if (left_node) in g_tree_remove_internal()
839 else if (left_node) in g_tree_remove_internal()
860 else if (left_node) in g_tree_remove_internal()
917 else if (left_node) in g_tree_remove_internal()
930 left_node = (bparent && balance == bparent->left); in g_tree_remove_internal()
[all …]
/third_party/mindspore/mindspore/ccsrc/pipeline/jit/parse/
Dparse_dynamic.cc71 …py::object left_node = parse::python_adapter::GetPyObjAttr(test_node, parse::NAMED_PRIMITIVE_LEFT); in ParseIfWhileExprNode() local
77 auto left = ParseNodeName(ast, left_node, parse::AST_MAIN_TYPE_EXPR); in ParseIfWhileExprNode()
81 … auto left_value = parse::python_adapter::GetPyObjAttr(left_node, parse::NAMED_PRIMITIVE_VALUE); in ParseIfWhileExprNode()
83 if (py::hasattr(left_node, "attr") && py::hasattr(left_value, "id")) { in ParseIfWhileExprNode()
84 …ble = py::cast<std::string>(left_value.attr("id")) + py::cast<std::string>(left_node.attr("attr")); in ParseIfWhileExprNode()
96 …py::object value_in_subscript = parse::python_adapter::GetPyObjAttr(left_node, parse::NAMED_PRIMIT… in ParseIfWhileExprNode()
Dparse.cc495 AnfNodePtr left_node = ParseExprNode(block, left); in ParseBinOp() local
496 if (left_node == nullptr) { in ParseBinOp()
508 return block->func_graph()->NewCNodeInOrder({op_node, left_node, right_node}); in ParseBinOp()
829 AnfNodePtr left_node = ParseExprNode(block, left); in ParseCompare() local
834 return block->func_graph()->NewCNodeInOrder({op_node, left_node, right_node}); in ParseCompare()
/third_party/python/Lib/lib2to3/fixes/
Dfix_metaclass.py114 left_node = expr_node.children[0]
115 if isinstance(left_node, Leaf) and \
116 left_node.value == '__metaclass__':
/third_party/gn/src/gn/
Doperators.cc589 const ParseNode* left_node, in ExecuteOr() argument
592 Value left = GetValueOrFillError(op_node, left_node, "left", scope, err); in ExecuteOr()
619 const ParseNode* left_node, in ExecuteAnd() argument
622 Value left = GetValueOrFillError(op_node, left_node, "left", scope, err); in ExecuteAnd()