| /third_party/glib/glib/ |
| D | gsequence.c | 106 GSequenceNode * end_node; member
191 return seq->end_node == iter; in seq_is_end()
221 GSequenceNode *end_node; member
235 if (node1 == info->end_node) in iter_compare()
238 if (node2 == info->end_node) in iter_compare()
268 seq->end_node = node_new (seq); in g_sequence_new()
294 node_free (seq->end_node, seq); in g_sequence_free()
470 node_insert_before (seq->end_node, node); in g_sequence_append()
497 first = node_get_first (seq->end_node); in g_sequence_prepend()
696 info.end_node = seq->end_node; in g_sequence_sort()
[all …]
|
| /third_party/boost/boost/lockfree/ |
| D | stack.hpp | 252 void link_nodes_atomic(node * new_top_node, node * end_node) in link_nodes_atomic() argument
257 end_node->next = pool.get_handle(old_tos); in link_nodes_atomic()
264 void link_nodes_unsafe(node * new_top_node, node * end_node) in link_nodes_unsafe() argument
269 end_node->next = pool.get_handle(old_tos); in link_nodes_unsafe()
278 node * end_node = pool.template construct<Threadsafe, Bounded>(*it++); in prepare_node_list() local
279 if (end_node == NULL) { in prepare_node_list()
284 node * new_top_node = end_node; in prepare_node_list()
285 end_node->next = NULL; in prepare_node_list()
307 return make_tuple(new_top_node, end_node); in prepare_node_list()
355 node * end_node; in do_push() local
[all …]
|
| /third_party/boost/boost/spirit/home/support/detail/lexer/parser/tree/ |
| D | end_node.hpp | 18 class end_node : public node class
21 end_node (const std::size_t id_, const std::size_t unique_id_, in end_node() function in boost::lexer::detail::end_node
32 virtual ~end_node () in ~end_node()
|
| /third_party/boost/boost/container/ |
| D | stable_vector.hpp | 242 static void readjust_end_node(index_type &index, node_base_type &end_node) in readjust_end_node()
247 end_node_idx_ref = node_base_ptr_traits::pointer_to(end_node); in readjust_end_node()
248 end_node.up = node_base_ptr_ptr_traits::pointer_to(end_node_idx_ref); in readjust_end_node()
251 end_node.up = node_base_ptr_ptr(); in readjust_end_node()
255 …static void initialize_end_node(index_type &index, node_base_type &end_node, const size_type index… in initialize_end_node()
261 end_node_ref = node_base_ptr_traits::pointer_to(end_node); in initialize_end_node()
262 end_node.up = index_traits::ptr_to_node_base_ptr(end_node_ref); in initialize_end_node()
1201 index_traits_type::initialize_end_node(this->index, this->internal_data.end_node, n); in reserve()
1231 this->internal_data.end_node.up = node_base_ptr_ptr(); in shrink_to_fit()
1862 index_traits_type::initialize_end_node(this->index, this->internal_data.end_node, num_new); in priv_insert_forward_non_templated()
[all …]
|
| /third_party/mindspore/mindspore/lite/src/ |
| D | sub_graph_split.cc | 86 auto end_node = model_->graph_.all_nodes_.at(ends.front()); in CheckIsParallelSubGraph() local
88 !IsOfflineParallelNode(end_node->primitive_, end_node->device_type_)) { in CheckIsParallelSubGraph()
105 for (const auto &output : end_node->output_indices_) { in CheckIsParallelSubGraph()
293 LiteGraph::Node *end_node = model_->graph_.all_nodes_[end_index]; in ConvertSubGraphToModel() local
294 std::vector<uint32_t> outputs = end_node->output_indices_; in ConvertSubGraphToModel()
1020 for (uint32_t end_node : sub->ends_) { in CheckSubHeadEnd() local
1021 if (std::find(sub->nodes_.begin(), sub->nodes_.end(), end_node) == sub->nodes_.end()) { in CheckSubHeadEnd()
1022 delete_end.push_back(end_node); in CheckSubHeadEnd()
|
| /third_party/mindspore/mindspore/_extends/parse/ |
| D | parser.py | 727 end_node = node[-1]
730 end_node = node
734 hasattr(end_node, "col_offset"):
736 end_lineno, end_colno = end_node.last_token.end
|
| /third_party/mindspore/mindspore/ccsrc/frontend/parallel/graph_util/ |
| D | pipeline_split_utils.cc | 505 auto end_node = GetPreNode(temp_node); in LastStageEndNode() local
506 MS_EXCEPTION_IF_NULL(end_node); in LastStageEndNode()
507 auto end_cnode = end_node->cast<CNodePtr>(); in LastStageEndNode()
509 auto end_prim = GetCNodePrimitive(end_node); in LastStageEndNode()
515 manager->SetEdge(end_node, 0, value_node); in LastStageEndNode()
|
| /third_party/boost/boost/spirit/home/support/detail/lexer/parser/ |
| D | parser.hpp | 117 node_ptr_vector_->push_back (static_cast<end_node *>(0)); in parse()
119 node *rhs_node_ = new end_node (id_, unique_id_, dfa_state_); in parse()
|
| /third_party/boost/boost/intrusive/ |
| D | treap_algorithms.hpp | 190 static node_ptr end_node(const_node_ptr header);
665 node_ptr end = end_node(header); in check_invariant()
|
| D | bstree.hpp | 158 …{ return iterator(node_algorithms::end_node(this->header_ptr()), this->priv_value_traits_ptr()); … in end()
164 …{ return const_iterator(node_algorithms::end_node(this->header_ptr()), this->priv_value_traits_pt… in cend()
2002 , itend(node_algorithms::end_node (source.header_ptr())); in merge_unique()
2038 , itend(node_algorithms::end_node (source.header_ptr())); in merge_equal()
|
| D | treap.hpp | 1044 , itend(node_algorithms::end_node (source.header_ptr())); in merge_unique()
1070 , itend(node_algorithms::end_node (source.header_ptr())); in merge_equal()
|
| D | sgtree.hpp | 725 , itend(node_algorithms::end_node (source.header_ptr())); in merge_unique()
756 , itend(node_algorithms::end_node (source.header_ptr())); in merge_equal()
|
| D | sgtree_algorithms.hpp | 95 static node_ptr end_node(const_node_ptr header);
|
| D | rbtree_algorithms.hpp | 200 static node_ptr end_node(const const_node_ptr & header);
|
| D | splaytree_algorithms.hpp | 185 static node_ptr end_node(const const_node_ptr & header);
|
| D | avltree_algorithms.hpp | 176 static node_ptr end_node(const const_node_ptr & header);
|
| D | bstree_algorithms.hpp | 227 BOOST_INTRUSIVE_FORCEINLINE static node_ptr end_node(const const_node_ptr & header) in end_node() function in boost::intrusive::bstree_algorithms
672 node_ptr end(end_node(header)); in size()
|
| /third_party/glib/glib/tests/ |
| D | sequence.c | 10 GSequenceNode * end_node; member
61 GSequenceNode *node = seq->end_node; in g_sequence_check()
71 g_assert (seq->end_node == node); in g_sequence_check()
|
| /third_party/mindspore/mindspore/ccsrc/backend/session/ |
| D | ascend_auto_monad.cc | 758 const auto &end_node = call_info.call_sites.back().cnode; in SetIterEndAttrForTopGraph() local
759 end_iter = std::find(nodes.rbegin(), nodes.rend(), end_node); in SetIterEndAttrForTopGraph()
788 const auto &end_node = context->call_info_map[kg].call_sites.back().cnode; in SetIterEndAttr() local
789 end_iter = std::find(nodes.rbegin(), nodes.rend(), end_node); in SetIterEndAttr()
|