| /third_party/ltp/testcases/kernel/syscalls/migrate_pages/ |
| D | migrate_pages03.c | 43 static unsigned long *new_nodes[2]; variable
67 new_nodes[0] = SAFE_MALLOC(nodemask_size); in setup()
68 new_nodes[1] = SAFE_MALLOC(nodemask_size); in setup()
69 memset(new_nodes[0], 0, nodemask_size); in setup()
70 memset(new_nodes[1], 0, nodemask_size); in setup()
71 set_bit(new_nodes[0], nodes[0], 1); in setup()
72 set_bit(new_nodes[1], nodes[1], 1); in setup()
89 if (mbind(test_pages[n], page_size, MPOL_BIND, new_nodes[0], in setup()
110 free(new_nodes[0]); in cleanup()
111 free(new_nodes[1]); in cleanup()
[all …]
|
| D | migrate_pages01.c | 127 unsigned long *old_nodes, *new_nodes; in test_invalid_nodes() local
141 new_nodes = SAFE_MALLOC(NULL, sane_nodemask_size); in test_invalid_nodes()
143 memset(new_nodes, 0, sane_nodemask_size); in test_invalid_nodes()
144 set_bit(new_nodes, invalid_node, 1); in test_invalid_nodes()
147 old_nodes, new_nodes)); in test_invalid_nodes()
151 free(new_nodes); in test_invalid_nodes()
|
| D | migrate_pages02.c | 72 unsigned long *old_nodes, *new_nodes; in migrate_to_node() local
80 new_nodes = SAFE_MALLOC(nodemask_size); in migrate_to_node()
83 memset(new_nodes, 0, nodemask_size); in migrate_to_node()
86 set_bit(new_nodes, node, 1); in migrate_to_node()
89 new_nodes)); in migrate_to_node()
101 free(new_nodes); in migrate_to_node()
|
| /third_party/mindspore/mindspore/ccsrc/runtime/device/ascend/ |
| D | kernel_build_ascend.cc | 160 … const mindspore::CNodePtr &pre_node, std::vector<mindspore::CNodePtr> *new_nodes) { in AddTbeClearZeroNode() argument
163 MS_EXCEPTION_IF_NULL(new_nodes); in AddTbeClearZeroNode()
182 new_nodes->push_back(clear_zero); in AddTbeClearZeroNode()
189 std::vector<mindspore::CNodePtr> *new_nodes) { in AddFusionTbeClearZeroNode() argument
208 auto it = std::find(new_nodes->begin(), new_nodes->end(), first_clear_node); in AddFusionTbeClearZeroNode()
209 if (it != new_nodes->end()) { in AddFusionTbeClearZeroNode()
210 new_nodes->insert(it, clear_zero); in AddFusionTbeClearZeroNode()
212 new_nodes->insert(new_nodes->begin(), clear_zero); in AddFusionTbeClearZeroNode()
352 std::vector<CNodePtr> new_nodes; in TbeClearZeroNodeFusion() local
386 new_nodes.push_back(clear_zero); in TbeClearZeroNodeFusion()
[all …]
|
| /third_party/mindspore/mindspore/lite/tools/converter/legacy_optimizer/graph/ |
| D | topological_sort_pass.cc | 31 std::vector<std::unique_ptr<schema::CNodeT>> new_nodes; in Run() local
69 new_nodes.emplace_back(std::move(node)); in Run()
70 new_subgraph_node_indices.push_back(new_nodes.size() - 1); in Run()
75 if (new_nodes.size() != old_nodes.size()) { in Run()
77 << ", new_nodes size: " << new_nodes.size(); in Run()
80 graph->nodes.swap(new_nodes); in Run()
|
| D | subgraph_node_pass.cc | 94 std::vector<schema::CNodeT *> new_nodes{}; in Run() local
95 std::transform(graph->nodes.begin(), graph->nodes.end(), std::back_inserter(new_nodes), in Run()
99 if (!IsContain(new_nodes, *it)) { in Run()
115 for (uint32_t i = 0; i < new_nodes.size(); i++) { in Run()
116 if (!IsContain(old_nodes_, new_nodes[i])) { in Run()
|
| /third_party/python/Lib/lib2to3/fixes/ |
| D | fix_urllib.py | 137 new_nodes = []
157 new_nodes.append(new)
159 if new_nodes:
161 for new_node in new_nodes[:-1]:
163 nodes.append(new_nodes[-1])
|
| /third_party/cef/tools/yapf/yapf/yapflib/ |
| D | pytree_utils.py | 136 def InsertNodesBefore(new_nodes, target): argument
147 for node in new_nodes:
151 def InsertNodesAfter(new_nodes, target): argument
162 for node in reversed(new_nodes):
|
| /third_party/mindspore/mindspore/lite/tools/common/ |
| D | func_graph_subgraph.cc | 304 auto new_nodes = this->GetNodes(); in MergeSubGraph() local
306 new_nodes.insert(new_nodes2.begin(), new_nodes2.end()); in MergeSubGraph()
307 new_nodes.insert(common_outputs.begin(), common_outputs.end()); in MergeSubGraph()
308 if (this->Reset(new_nodes, common_outputs) != RET_OK) { in MergeSubGraph()
316 auto new_nodes = this->GetNodes(); in MergeSubGraph() local
318 new_nodes.insert(new_nodes2.begin(), new_nodes2.end()); in MergeSubGraph()
319 if (this->Reset(new_nodes) != RET_OK) { in MergeSubGraph()
|
| /third_party/gettext/libtextstyle/gnulib-local/lib/glib/ |
| D | ghash.c | 750 GHashNode **new_nodes; in g_hash_table_resize() local
760 new_nodes = g_new0 (GHashNode*, new_size); in g_hash_table_resize()
769 node->next = new_nodes[hash_val]; in g_hash_table_resize()
770 new_nodes[hash_val] = node; in g_hash_table_resize()
774 hash_table->nodes = new_nodes; in g_hash_table_resize()
|
| /third_party/mindspore/mindspore/core/ir/ |
| D | manager.cc | 59 NodeCounter new_nodes; member
72 std::vector<AnfNodePtr> GetAddedNodes() { return new_nodes.subtract(del_nodes); } in GetAddedNodes()
73 std::vector<AnfNodePtr> GetRemovedNodes() { return del_nodes.subtract(new_nodes); } in GetRemovedNodes()
86 counter->new_nodes.add(edge_.input); in Apply()
102 counter->new_nodes.add(input_); in Apply()
124 counter->new_nodes.add(std::move(p)); in Apply()
140 counter->new_nodes.add(std::move(param_)); in Apply()
156 counter->new_nodes.add(std::move(param_)); in Apply()
341 std::vector<AnfNodePtr> new_nodes = func_graph->parameters(); in AddFuncGraph() local
344 (void)new_nodes.emplace_back(std::move(return_node)); in AddFuncGraph()
[all …]
|
| /third_party/mindspore/mindspore/lite/src/train/ |
| D | train_export.cc | 447 std::vector<std::unique_ptr<schema::CNodeT>> new_nodes; in TopologicalSort() local
485 new_nodes.emplace_back(std::move(node)); in TopologicalSort()
486 new_subgraph_node_indices.push_back(new_nodes.size() - 1); in TopologicalSort()
491 if (new_nodes.size() != old_nodes.size()) { in TopologicalSort()
493 << ", new_nodes size: " << new_nodes.size(); in TopologicalSort()
496 meta_graph_->nodes.swap(new_nodes); in TopologicalSort()
|
| /third_party/mindspore/tests/ut/cpp/ir/ |
| D | clone_test.cc | 60 AnfNodeSet new_nodes = AnfNodeSet(DeepLinkedGraphSearch(new_root)); in SuccessfulInlining() local
63 ASSERT_TRUE(new_nodes.contains(p)); in SuccessfulInlining()
|
| /third_party/mindspore/mindspore/ccsrc/backend/optimizer/common/ |
| D | helper.cc | 330 std::vector<CNodePtr> new_nodes; in HideNopNode() local
334 new_nodes.push_back(cnode); in HideNopNode()
337 graph->set_execution_order(new_nodes); in HideNopNode()
349 std::vector<CNodePtr> new_nodes; in RemoveNopNode() local
383 new_nodes.push_back(cnode); in RemoveNopNode()
385 graph->set_execution_order(new_nodes); in RemoveNopNode()
|
| /third_party/boost/boost/container/ |
| D | deque.hpp | 2201 size_type new_nodes = (new_elems + get_block_size() - 1) / in priv_reserve_elements_at_front() local
2204 if (new_nodes > s){ in priv_reserve_elements_at_front()
2205 this->priv_reallocate_map(new_nodes, true); in priv_reserve_elements_at_front()
2209 for (; i <= new_nodes; ++i) in priv_reserve_elements_at_front()
2227 size_type new_nodes = (new_elems + get_block_size() - 1)/get_block_size(); in priv_reserve_elements_at_back() local
2229 if (new_nodes + 1 > s){ in priv_reserve_elements_at_back()
2230 this->priv_reallocate_map(new_nodes, false); in priv_reserve_elements_at_back()
2234 for (; i <= new_nodes; ++i) in priv_reserve_elements_at_back()
|
| /third_party/mindspore/mindspore/lite/tools/converter/ |
| D | anf_transform.cc | 363 auto new_nodes = new_fg->GetOrderedCnodes(); in GetFuncGraphs() local
364 to_process.insert(to_process.end(), new_nodes.begin(), new_nodes.end()); in GetFuncGraphs()
|