Home
last modified time | relevance | path

Searched refs:edge_name (Results 1 – 25 of 32) sorted by relevance

12

/third_party/node/src/
Dmemory_tracker-inl.h12 inline const char* GetNodeName(const char* node_name, const char* edge_name) { in GetNodeName() argument
16 if (edge_name != nullptr) { in GetNodeName()
17 return edge_name; in GetNodeName()
78 void MemoryTracker::TrackFieldWithSize(const char* edge_name, in TrackFieldWithSize() argument
81 if (size > 0) AddNode(GetNodeName(node_name, edge_name), size, edge_name); in TrackFieldWithSize()
84 void MemoryTracker::TrackInlineFieldWithSize(const char* edge_name, in TrackInlineFieldWithSize() argument
87 if (size > 0) AddNode(GetNodeName(node_name, edge_name), size, edge_name); in TrackInlineFieldWithSize()
92 void MemoryTracker::TrackField(const char* edge_name, in TrackField() argument
95 TrackField(edge_name, &value); in TrackField()
98 void MemoryTracker::TrackField(const char* edge_name, in TrackField() argument
[all …]
Dmemory_tracker.h135 inline void TrackFieldWithSize(const char* edge_name,
138 inline void TrackInlineFieldWithSize(const char* edge_name,
144 inline void TrackField(const char* edge_name,
149 inline void TrackField(const char* edge_name,
154 void TrackField(const char* edge_name,
165 inline void TrackField(const char* edge_name,
171 inline void TrackField(const char* edge_name,
176 inline void TrackField(const char* edge_name,
183 inline void TrackField(const char* edge_name,
186 inline void TrackField(const char* edge_name,
[all …]
/third_party/node/test/pummel/
Dtest-heapdump-http2.js31 { node_name: 'Http2Stream', edge_name: 'wrapped' }, property
40 { node_name: 'FileHandle', edge_name: 'wrapped' }, property
48 { node_name: 'TCP', edge_name: 'wrapped' }, property
55 { node_name: 'TCP', edge_name: 'wrapped' }, property
63 { node_name: 'StreamPipe', edge_name: 'wrapped' }, property
71 { node_name: 'Http2Session', edge_name: 'wrapped' }, property
72 { node_name: 'Node / nghttp2_memory', edge_name: 'nghttp2_memory' }, property
74 node_name: 'Node / streams', edge_name: 'streams' property
Dtest-heapdump-env.js18 { node_name: 'Node / cleanup_hooks', edge_name: 'cleanup_hooks' }, property
19 { node_name: 'process', edge_name: 'process_object' }, property
20 { node_name: 'Node / IsolateData', edge_name: 'isolate_data' }, property
Dtest-heapdump-worker.js12 { node_name: 'Node / MessagePort', edge_name: 'parent_port' }, property
13 { node_name: 'Worker', edge_name: 'wrapped' }, property
20 { node_name: 'Node / MessagePortData', edge_name: 'data' }, property
Dtest-heapdump-zlib.js13 { node_name: 'Zlib', edge_name: 'wrapped' }, property
23 { node_name: 'Zlib', edge_name: 'wrapped' }, property
24 { node_name: 'Node / zlib_memory', edge_name: 'zlib_memory' }, property
Dtest-heapdump-tls.js27 { node_name: 'Node / NodeBIO', edge_name: 'enc_out' }, property
28 { node_name: 'Node / NodeBIO', edge_name: 'enc_in' }, property
30 { node_name: 'TLSWrap', edge_name: 'wrapped' }, property
Dtest-heapdump-inspector.js12 { node_name: 'Node / InspectorSession', edge_name: 'session' }, property
32 { node_name: 'Node / InspectorSession', edge_name: 'session' }, property
33 { node_name: 'Connection', edge_name: 'wrapped' }, property
Dtest-heapdump-dns.js13 { node_name: 'Node / NodeAresTask::List', edge_name: 'task_list' }, property
15 { node_name: 'ChannelWrap', edge_name: 'wrapped' }, property
Dtest-heapdump-fs-promise.js12 { node_name: 'FSReqPromise', edge_name: 'wrapped' }, property
13 { node_name: 'Float64Array', edge_name: 'stats_field_array' }, property
Dtest-worker-take-heapsnapshot.js17 { node_name: 'Node / MessagePortData', edge_name: 'data' }, property
/third_party/mindspore/tests/ut/cpp/parallel/auto_parallel/
Dgraph_costmodel_test.cc127 std::string edge_name = "MatMul-MatMul"; in ConstructStarGraph2() local
128 …std::shared_ptr<Edge> edge_m1_m2 = std::make_shared<Edge>(edge_name, matmul1, matmul2, 0, 0, false… in ConstructStarGraph2()
129 …std::shared_ptr<Edge> edge_m0_m2 = std::make_shared<Edge>(edge_name, matmul0, matmul2, 0, 1, false… in ConstructStarGraph2()
130 …std::shared_ptr<Edge> edge_m1_m3 = std::make_shared<Edge>(edge_name, matmul1, matmul3, 0, 1, false… in ConstructStarGraph2()
157 std::string edge_name = "MatMul-MatMul"; in ConstructDiamondGraph() local
158 …std::shared_ptr<Edge> edge_m1_m2 = std::make_shared<Edge>(edge_name, matmul1, matmul2, 0, 0, false… in ConstructDiamondGraph()
159 …std::shared_ptr<Edge> edge_m2_m4 = std::make_shared<Edge>(edge_name, matmul2, matmul4, 0, 0, false… in ConstructDiamondGraph()
160 …std::shared_ptr<Edge> edge_m1_m3 = std::make_shared<Edge>(edge_name, matmul1, matmul3, 0, 1, false… in ConstructDiamondGraph()
161 …std::shared_ptr<Edge> edge_m3_m4 = std::make_shared<Edge>(edge_name, matmul3, matmul4, 0, 1, false… in ConstructDiamondGraph()
182 std::string edge_name = "MatMul-MatMul"; in ConstructLinearGraph() local
[all …]
Dedge_costmodel_test.cc109 std::string edge_name = "MatMul-MatMul"; in TEST_F() local
110 …std::shared_ptr<Edge> edge_m1_m2 = std::make_shared<Edge>(edge_name, matmul1, matmul2, 0, 0, false… in TEST_F()
119 std::string edge_name = "MatMul-MatMul"; in TEST_F() local
120 …std::shared_ptr<Edge> edge_m1_m2 = std::make_shared<Edge>(edge_name, matmul1, matmul2, 0, 0, false… in TEST_F()
121 …std::shared_ptr<Edge> edge_m2_m4 = std::make_shared<Edge>(edge_name, matmul2, matmul4, 0, 0, false… in TEST_F()
132 std::shared_ptr<Edge> new_edge = std::make_shared<Edge>(edge_name, matmul1, matmul4, 0, 0, false); in TEST_F()
139 std::string edge_name = "MatMul-MatMul"; in TEST_F() local
140 …std::shared_ptr<Edge> edge_m1_m5 = std::make_shared<Edge>(edge_name, matmul1, matmul5, 0, 0, false… in TEST_F()
141 …std::shared_ptr<Edge> edge_m1_m5_2 = std::make_shared<Edge>(edge_name, matmul1, matmul5, 0, 1, fal… in TEST_F()
160 std::make_shared<Edge>(edge_name, matmul1, matmul5, output_indexs, input_indexs, true); in TEST_F()
Ddp_algo_test.cc687 std::string edge_name = "MatMul-MatMul"; in ConstructStarGraph() local
688 …std::shared_ptr<Edge> edge_m1_m2 = std::make_shared<Edge>(edge_name, matmul1, matmul2, 0, 0, false… in ConstructStarGraph()
689 …std::shared_ptr<Edge> edge_m2_m4 = std::make_shared<Edge>(edge_name, matmul2, matmul4, 0, 0, false… in ConstructStarGraph()
690 …std::shared_ptr<Edge> edge_m3_m4 = std::make_shared<Edge>(edge_name, matmul3, matmul4, 0, 1, false… in ConstructStarGraph()
716 std::string edge_name = "MatMul-MatMul"; in ConstructStarGraph2() local
717 …std::shared_ptr<Edge> edge_m0_m2 = std::make_shared<Edge>(edge_name, matmul0, matmul2, 0, 1, false… in ConstructStarGraph2()
718 …std::shared_ptr<Edge> edge_m1_m2 = std::make_shared<Edge>(edge_name, matmul1, matmul2, 0, 0, false… in ConstructStarGraph2()
719 …std::shared_ptr<Edge> edge_m1_m3 = std::make_shared<Edge>(edge_name, matmul1, matmul3, 0, 1, false… in ConstructStarGraph2()
745 std::string edge_name = "MatMul-MatMul"; in ConstructStarGraph3() local
746 …std::shared_ptr<Edge> edge_m2_m1 = std::make_shared<Edge>(edge_name, matmul2, matmul1, 0, 0, false… in ConstructStarGraph3()
[all …]
/third_party/mindspore/mindspore/ccsrc/frontend/parallel/auto_parallel/
Dedge_costmodel.h40 Edge(const std::string &edge_name, const std::shared_ptr<OperatorInfo> &prev_op, in Edge() argument
43 : edge_name_(edge_name), in Edge()
52 Edge(const std::string &edge_name, const std::shared_ptr<OperatorInfo> &prev_op, in Edge() argument
55 : edge_name_(edge_name), in Edge()
63 Edge(const std::string &edge_name, const std::shared_ptr<OperatorInfo> &prev_op, in Edge() argument
66 : edge_name_(edge_name), in Edge()
80 std::string edge_name() const { return edge_name_; } in edge_name() function
/third_party/boost/libs/graph/test/
Dmcgregor_subgraphs_test.cpp100 EdgeNameMap ename_map_common = get(boost::edge_name, m_common_subgraph); in operator ()()
101 EdgeNameMap ename_map1 = get(boost::edge_name, subgraph1); in operator ()()
102 EdgeNameMap ename_map2 = get(boost::edge_name, subgraph2); in operator ()()
193 make_label_writer(get(boost::edge_name, m_graph1))); in operator ()()
358 EdgeNameMap ename_map_common = get(boost::edge_name, common_subgraph); in main()
359 EdgeNameMap ename_map1 = get(boost::edge_name, graph1); in main()
360 EdgeNameMap ename_map2 = get(boost::edge_name, graph2); in main()
413 make_label_writer(get(boost::edge_name, common_subgraph))); in main()
Dvf2_sub_graph_iso_test.cpp275 = make_property_map_equivalent(get(edge_name, g1), get(edge_name, g2)); in test_vf2_sub_graph_iso()
310 make_label_writer(get(boost::edge_name, g1))); in test_vf2_sub_graph_iso()
315 make_label_writer(get(boost::edge_name, g2))); in test_vf2_sub_graph_iso()
Dgraphviz_test.cpp123 std::pair< std::string, std::string > edge_name = make_pair( local
127 BOOST_CHECK(weights.find(edge_name) != weights.end());
128 double ref_weight = weights.find(edge_name)->second;
/third_party/boost/libs/graph/example/
Dgerdemann.cpp75 return std::make_pair(e1.get_target(), boost::get(boost::edge_name, e1)) in operator ()()
76 < std::make_pair(e2.get_target(), boost::get(boost::edge_name, e2)); in operator ()()
106 boost::get(boost::edge_name, g, e)); in operator ()()
135 property_map< graph_type, edge_name_t >::type name = get(edge_name, g); in main()
Dordered_out_edges.cpp53 return std::make_pair(e1.get_target(), boost::get(boost::edge_name, e1)) in operator ()()
54 < std::make_pair(e2.get_target(), boost::get(boost::edge_name, e2)); in operator ()()
116 property_map< graph_type, edge_name_t >::type name = get(edge_name, g); in main()
Dvf2_sub_graph_iso_multi_example.cpp82 get(edge_name, graph1), get(edge_name, graph2)); in main()
/third_party/boost/libs/graph_parallel/test/
Dhohberg_biconnected_components_test.cpp40 color_to_name[get(edge_color, g, e)] = get(edge_name, g, e); in check_components()
41 BOOST_CHECK(color_to_name[get(edge_color,g,e)] == get(edge_name,g,e)); in check_components()
43 if (color_to_name[get(edge_color,g,e)] != get(edge_name,g,e)) { in check_components()
50 << get(edge_name,g,e) << " on edge " in check_components()
/third_party/mindspore/tests/ut/cpp/parallel/
Dstep_auto_parallel_test.cc190 std::string edge_name = u_prim->name() + "-" + v_prim->name(); in TEST_F() local
191 …std::shared_ptr<Edge> edge_ptr = std::make_shared<Edge>(edge_name, u_matmul_info, v_matmul_info, 0… in TEST_F()
193 ASSERT_EQ(edge_ptr->edge_name(), expected_name); in TEST_F()
/third_party/node/test/common/
Dheap.js91 function isEdge(edge, { node_name, edge_name }) { field
92 if (edge.name !== edge_name) {
/third_party/mindspore/mindspore/ccsrc/frontend/parallel/
Dstep_auto_parallel.cc598 …std::string edge_name = prev_op_info->name() + OPERATOR_TO_OPERATOR_CONNECTOR + node_op_info->name… in CreateEdgeBetweenTwoOps() local
600 if (entire_costgraph->IsEdgeInCostGraph(edge_name, output_index, input_index - 1)) { in CreateEdgeBetweenTwoOps()
604 MS_LOG(INFO) << "Creating edge: " << edge_name; in CreateEdgeBetweenTwoOps()
618 …std::make_shared<Edge>(edge_name, prev_op_info, node_op_info, output_index, input_index - 1, false… in CreateEdgeBetweenTwoOps()
620 …edge_ptr = std::make_shared<Edge>(edge_name, prev_op_info, node_op_info, output_index, input_index… in CreateEdgeBetweenTwoOps()
821 …std::string edge_name = std::string(IDENTITY_INFO) + OPERATOR_TO_OPERATOR_CONNECTOR + target_op_in… in AugmentCostGraph() local
823 if (entire_costgraph->IsEdgeInCostGraph(edge_name, 0, LongToSize(input_index - 1))) { in AugmentCostGraph()
827 …std::make_shared<Edge>(edge_name, tmp_identity_ptr, target_op_info, 0, input_index - 1, false, tru… in AugmentCostGraph()

12