Searched refs:old_node (Results 1 – 11 of 11) sorted by relevance
| /third_party/node/deps/cares/src/lib/ |
| D | ares_llist.c | 47 struct list_node* old_node) { in ares__insert_in_list() argument
48 new_node->next = old_node; in ares__insert_in_list()
49 new_node->prev = old_node->prev; in ares__insert_in_list()
50 old_node->prev->next = new_node; in ares__insert_in_list()
51 old_node->prev = new_node; in ares__insert_in_list()
|
| D | ares_llist.h | 35 struct list_node* old_node);
|
| /third_party/cares/ |
| D | ares_llist.c | 47 struct list_node* old_node) { in ares__insert_in_list() argument
48 new_node->next = old_node; in ares__insert_in_list()
49 new_node->prev = old_node->prev; in ares__insert_in_list()
50 old_node->prev->next = new_node; in ares__insert_in_list()
51 old_node->prev = new_node; in ares__insert_in_list()
|
| D | ares_llist.h | 35 struct list_node* old_node);
|
| /third_party/boost/boost/xpressive/detail/core/ |
| D | list.hpp | 140 node *old_node = static_cast<node *>(_sentry._next); in pop_front() local
141 _sentry._next = old_node->_next; in pop_front()
143 delete old_node; in pop_front()
149 node *old_node = static_cast<node *>(_sentry._prev); in pop_back() local
150 _sentry._prev = old_node->_prev; in pop_back()
152 delete old_node; in pop_back()
|
| /third_party/uboot/u-boot-2020.01/scripts/dtc/ |
| D | livetree.c | 137 struct node *merge_nodes(struct node *old_node, struct node *new_node) in merge_nodes() argument
143 old_node->deleted = 0; in merge_nodes()
147 add_label(&old_node->labels, l->label); in merge_nodes()
158 delete_property_by_name(old_node, new_prop->name); in merge_nodes()
164 for_each_property_withdel(old_node, old_prop) { in merge_nodes()
180 add_property(old_node, new_prop); in merge_nodes()
193 delete_node_by_name(old_node, new_child->name); in merge_nodes()
199 for_each_child_withdel(old_node, old_child) { in merge_nodes()
209 add_child(old_node, new_child); in merge_nodes()
216 return old_node; in merge_nodes()
|
| D | dtc.h | 206 struct node *merge_nodes(struct node *old_node, struct node *new_node);
207 struct node *add_orphan_node(struct node *old_node, struct node *new_node, char *ref);
|
| /third_party/boost/boost/lockfree/detail/ |
| D | freelist.hpp | 561 T * old_node = NodeStorage::nodes() + index; in allocate_impl() local
562 tagged_index * next_index = reinterpret_cast<tagged_index*>(old_node); in allocate_impl()
579 T * old_node = NodeStorage::nodes() + index; in allocate_impl_unsafe() local
580 tagged_index * next_index = reinterpret_cast<tagged_index*>(old_node); in allocate_impl_unsafe()
|
| /third_party/uboot/u-boot-2020.01/fs/cbfs/ |
| D | cbfs.c | 141 struct cbfs_cachenode *old_node = cache_node; in file_cbfs_fill_cache() local
143 free(old_node); in file_cbfs_fill_cache()
|
| /third_party/python/Lib/ |
| D | ast.py | 175 def copy_location(new_node, old_node): argument
181 if attr in old_node._attributes and attr in new_node._attributes:
182 value = getattr(old_node, attr, None)
186 hasattr(old_node, attr) and attr.startswith("end_")
|
| /third_party/python/Doc/library/ |
| D | ast.rst | 1637 .. function:: copy_location(new_node, old_node)
1640 and :attr:`end_col_offset`) from *old_node* to *new_node* if possible,
|