| /third_party/mesa3d/src/compiler/glsl/ |
| D | ir_function_detect_recursion.cpp | 131 struct call_node : public exec_node { struct
210 call_node *node = new(mem_ctx) call_node; in visit_enter()
216 node = new(mem_ctx) call_node; in visit_enter()
233 foreach_in_list_safe(call_node, node, list) { in destroy_links()
255 struct call_node *n = (struct call_node *) f->callers.pop_head(); in remove_unlinked_functions()
260 struct call_node *n = (struct call_node *) f->callees.pop_head(); in remove_unlinked_functions()
|
| /third_party/mindspore/mindspore/ccsrc/frontend/operator/composite/ |
| D | map.cc | 117 auto call_node = func_graph->NewCNodeInOrder(inputs2); in FullMakeList() local
119 (void)inputs.insert(inputs.begin() + 1, call_node); in FullMakeList()
121 inputs.emplace_back(call_node); in FullMakeList()
176 auto call_node = func_graph->NewCNodeInOrder(inputs2); in FullMakeTuple() local
178 (void)inputs.insert(inputs.begin() + 1, call_node); in FullMakeTuple()
180 inputs.emplace_back(call_node); in FullMakeTuple()
217 auto call_node = func_graph->NewCNodeInOrder(inputs2); in FullMakeClass() local
220 (void)inputs.insert(inputs.begin() + kCallNodePosition, call_node); in FullMakeClass()
222 inputs.emplace_back(call_node); in FullMakeClass()
|
| D | composite.cc | 159 auto call_node = func_graph->NewCNodeInOrder(inputs2); in FullMake() local
161 inputs.insert(inputs.begin() + 1, call_node); in FullMake()
163 inputs.emplace_back(call_node); in FullMake()
217 auto call_node = func_graph->NewCNodeInOrder(inputs2); in FullMake() local
219 inputs.insert(inputs.begin() + 1, call_node); in FullMake()
221 inputs.emplace_back(call_node); in FullMake()
258 auto call_node = func_graph->NewCNodeInOrder(inputs2); in FullMake() local
260 inputs.insert(inputs.begin() + kPrimAndTypeLen, call_node); in FullMake()
262 inputs.emplace_back(call_node); in FullMake()
|
| /third_party/mindspore/mindspore/lite/tools/converter/import/ |
| D | mindir_control_flow_adjust.cc | 99 auto call_node = fg->NewCNode(call_node_inputs); in ModifyFgToCallAfterFg() local
100 MS_CHECK_TRUE_MSG(call_node != nullptr, RET_NULL_PTR, "Failed to create C node."); in ModifyFgToCallAfterFg()
101 call_node->set_fullname_with_scope("call_" + after_partial_cnode->fullname_with_scope()); in ModifyFgToCallAfterFg()
102 fg->set_output(call_node); in ModifyFgToCallAfterFg()
240 MS_ASSERT(call_node != nullptr); in InsertPartialFusionForRawCall()
|
| /third_party/mindspore/mindspore/lite/tools/optimizer/graph/ |
| D | control_flow_pass.cc | 491 auto call_node = cond_fg->NewCNode(call_node_inputs); in ProcessWhileOp() local
492 MS_CHECK_TRUE_MSG(call_node != nullptr, lite::RET_NULL_PTR, "call_node is nullptr"); in ProcessWhileOp()
493 call_node->set_fullname_with_scope("call_" + switch_cnode->fullname_with_scope()); in ProcessWhileOp()
494 cond_fg->set_output(call_node); in ProcessWhileOp()
632 auto call_node = then_fg->NewCNode(call_node_inputs); in CreateIfPartialNode() local
633 MS_CHECK_TRUE_MSG(call_node != nullptr, RET_FAILED, "NewCNode failed"); in CreateIfPartialNode()
634 call_node->set_fullname_with_scope("call_" + after_partial_cnode->fullname_with_scope()); in CreateIfPartialNode()
635 then_fg->set_output(call_node); in CreateIfPartialNode()
734 auto call_node = fg->NewCNode(call_node_inputs); in ProcessIfOp() local
735 MS_CHECK_TRUE_MSG(call_node != nullptr, RET_FAILED, "NewCNode failed"); in ProcessIfOp()
[all …]
|
| /third_party/selinux/libsepol/cil/src/ |
| D | cil_resolve_ast.c | 2634 void cil_print_recursive_call(struct cil_tree_node *call_node, struct cil_tree_node *terminating_no… in cil_print_recursive_call() argument
2642 for (curr = call_node; curr != terminating_node; curr = curr->parent) { in cil_print_recursive_call()
2644 if (curr != call_node) { in cil_print_recursive_call()
2669 int cil_check_recursive_call(struct cil_tree_node *call_node, struct cil_tree_node *macro_node) in cil_check_recursive_call() argument
2675 for (curr = call_node; curr != NULL; curr = curr->parent) { in cil_check_recursive_call()
2677 if (curr == call_node) { in cil_check_recursive_call()
2695 cil_print_recursive_call(call_node, curr); in cil_check_recursive_call()
2706 static int cil_build_call_args(struct cil_tree_node *call_node, struct cil_call *call, struct cil_m… in cil_build_call_args() argument
2718 cil_tree_log(call_node, CIL_ERR, "Unexpected arguments"); in cil_build_call_args()
2723 cil_tree_log(call_node, CIL_ERR, "Missing arguments"); in cil_build_call_args()
[all …]
|
| /third_party/mindspore/mindspore/lite/tools/common/ |
| D | func_graph_subgraph.cc | 604 auto call_node = return_node->inputs().at(1); in ApplySubGraph() local
605 MS_ASSERT(call_node != nullptr && utils::isa<CNodePtr>(call_node)); in ApplySubGraph()
606 auto call_cnode = utils::cast<CNodePtr>(call_node); in ApplySubGraph()
|
| /third_party/mindspore/mindspore/lite/tools/converter/legacy_optimizer/graph/ |
| D | infershape_pass.h | 56 int InferCallNode(const std::unique_ptr<CNodeT> &call_node, MetaGraphT *graph);
|
| D | infershape_pass.cc | 450 int InferShapePass::InferCallNode(const std::unique_ptr<CNodeT> &call_node, MetaGraphT *graph) { in InferCallNode() argument
451 if (call_node->inputIndex.size() < kCallInputMinSize) { in InferCallNode()
452 … MS_LOG(ERROR) << "call node input size: " << call_node->inputIndex.size() << " is less than one."; in InferCallNode()
455 auto call_first_input_index = call_node->inputIndex.front(); in InferCallNode()
|
| /third_party/mindspore/mindspore/ccsrc/runtime/framework/ |
| D | control_node_parser.cc | 331 std::vector<AnfNodePtr> FetchOutputByCallNode(const AnfNodePtr &call_node, std::set<AnfNodePtr> *ca… in FetchOutputByCallNode() argument
334 if ((*call_nodes).find(call_node) != (*call_nodes).end()) { in FetchOutputByCallNode()
337 (void)((*call_nodes).insert(call_node)); in FetchOutputByCallNode()
339 const auto func_graphs = FetchFuncGraphbyCallNode(call_node); in FetchOutputByCallNode()
875 const auto &call_node = input->cast<CNodePtr>(); in FetchValueNodeBySwitchNode() local
876 const auto &call_inputs = call_node->inputs(); in FetchValueNodeBySwitchNode()
|
| D | graph_scheduler.cc | 2077 for (const auto &call_node : call_nodes) { in LinkControlArrowForSwitchActor() local
2078 const auto &func_graphs = FetchFuncGraphbyCallNode(call_node); in LinkControlArrowForSwitchActor()
|
| /third_party/mindspore/mindspore/ccsrc/backend/session/ |
| D | kernel_graph.cc | 53 std::vector<AnfNodePtr> GetCallRealOutputs(const AnfNodePtr &call_node) { in GetCallRealOutputs() argument
55 …AnfAlgo::VisitKernelWithReturnType(call_node, 0, false, {prim::kPrimTupleGetItem, prim::kPrimMakeT… in GetCallRealOutputs()
1303 for (auto &call_node : call_nodes) { in UpdateChildGraphOrder() local
1304 MS_EXCEPTION_IF_NULL(call_node); in UpdateChildGraphOrder()
1305 auto call_child_graphs = AnfAlgo::GetCallSwitchKernelGraph(call_node->cast<CNodePtr>()); in UpdateChildGraphOrder()
|
| D | anf_runtime_algorithm.cc | 1742 bool AnfRuntimeAlgorithm::IsSwitchCall(const CNodePtr &call_node) { in IsSwitchCall() argument
1743 MS_EXCEPTION_IF_NULL(call_node); in IsSwitchCall()
1744 if (!CheckPrimitiveType(call_node, prim::kPrimCall)) { in IsSwitchCall()
1745 MS_LOG(EXCEPTION) << "Call node should be a 'call', but is a " << call_node->DebugString() in IsSwitchCall()
1746 << " trace: " << trace::DumpSourceLines(call_node); in IsSwitchCall()
1748 auto input1 = call_node->input(1); in IsSwitchCall()
1756 << " trace: " << trace::DumpSourceLines(call_node); in IsSwitchCall()
|
| D | anf_runtime_algorithm.h | 276 static bool IsSwitchCall(const CNodePtr &call_node);
|
| D | session_basic.cc | 867 auto call_node = graph->NewCNode(call_inputs); in ProcessNodeRetFunc() local
868 call_node->set_abstract(cnode->abstract()); in ProcessNodeRetFunc()
870 ret->set_input(kFirstDataInputIndex, call_node); in ProcessNodeRetFunc()
|
| /third_party/mindspore/mindspore/ccsrc/pipeline/jit/parse/ |
| D | parse.cc | 420 AnfNodePtr call_node = ParseExprNode(block, value_object); in ParseExpr() local
426 auto &no_return_node = call_node; in ParseExpr()
436 WriteAssignVars(block, target_node, call_node); in ParseExpr()
2195 auto call_node = func_graph->NewCNodeInOrder(inputs); in MakeTopGraph() local
2198 func_graph->set_output(call_node); in MakeTopGraph()
|