/third_party/mesa3d/src/util/ |
D | sparse_array.c | 143 uintptr_t new_root = _util_sparse_array_node_alloc(arr, root_level); in util_sparse_array_get() local 145 NULL_NODE, new_root); in util_sparse_array_get() 157 uintptr_t new_root = _util_sparse_array_node_alloc(arr, root_level + 1); in util_sparse_array_get() local 159 uintptr_t *new_root_children = _util_sparse_array_node_data(new_root); in util_sparse_array_get() 168 root = _util_sparse_array_set_or_free_node(&arr->root, root, new_root); in util_sparse_array_get()
|
/third_party/boost/boost/geometry/index/detail/rtree/visitors/ |
D | insert.hpp | 449 …subtree_destroyer new_root(rtree::create_node<allocators_type, internal_node>::apply(m_allocators)… in split() local 453 …rtree::elements(rtree::get<internal_node>(*new_root)).push_back(rtree::make_ptr_pair(n_box, m_root… in split() 454 …rtree::elements(rtree::get<internal_node>(*new_root)).push_back(additional_nodes[0]); … in split() 459 rtree::elements(rtree::get<internal_node>(*new_root)).clear(); in split() 464 m_root_node = new_root.get(); in split() 467 new_root.release(); in split()
|
/third_party/mindspore/tests/ut/cpp/ir/ |
D | clone_test.cc | 56 auto new_root = (*cl)[orig->output()]; in SuccessfulInlining() local 57 ASSERT_TRUE(new_root != orig->output()); in SuccessfulInlining() 60 AnfNodeSet new_nodes = AnfNodeSet(DeepLinkedGraphSearch(new_root)); in SuccessfulInlining()
|
/third_party/ltp/testcases/kernel/security/tomoyo/ |
D | include.h | 74 static inline int pivot_root(const char *new_root, const char *put_old) in pivot_root() argument 76 return syscall(__NR_pivot_root, new_root, put_old); in pivot_root() 79 static inline int pivot_root(const char *new_root, const char *put_old) in pivot_root() argument
|
/third_party/python/Lib/distutils/ |
D | util.py | 138 def change_root (new_root, pathname): argument 146 return os.path.join(new_root, pathname) 148 return os.path.join(new_root, pathname[1:]) 154 return os.path.join(new_root, path)
|
/third_party/python/Lib/importlib/ |
D | _bootstrap_external.py | 104 for new_root, tail in map(_os._path_splitroot, path_parts): 105 if new_root.startswith(path_sep_tuple) or new_root.endswith(path_sep_tuple): 106 root = new_root.rstrip(path_separators) or root 108 elif new_root.endswith(':'): 109 if root.casefold() != new_root.casefold(): 112 root = new_root 117 root = new_root or root
|
/third_party/python/Python/ |
D | hamt.c | 2292 PyHamtNode *new_root; in _PyHamt_Assoc() local 2300 new_root = hamt_node_assoc( in _PyHamt_Assoc() 2303 if (new_root == NULL) { in _PyHamt_Assoc() 2307 if (new_root == o->h_root) { in _PyHamt_Assoc() 2308 Py_DECREF(new_root); in _PyHamt_Assoc() 2315 Py_DECREF(new_root); in _PyHamt_Assoc() 2319 new_o->h_root = new_root; /* borrow */ in _PyHamt_Assoc() 2333 PyHamtNode *new_root = NULL; in _PyHamt_Without() local 2338 &new_root); in _PyHamt_Without() 2349 assert(new_root != NULL); in _PyHamt_Without() [all …]
|
/third_party/boost/boost/graph/distributed/ |
D | connected_components.hpp | 449 vertex_descriptor new_root; in parallel_connected_components() local 466 new_root = graph_traits<DistributedGraph>::null_vertex(); in parallel_connected_components() 471 new_root = get(p, *aliter); in parallel_connected_components() 473 if ( new_root != graph_traits<DistributedGraph>::null_vertex() ) in parallel_connected_components() 476 put(p, *liter, new_root); in parallel_connected_components()
|
/third_party/boost/boost/spirit/home/classic/symbols/impl/ |
D | tst.ipp | 123 node_t* new_root = other.root ? other.root->clone() : 0; 125 root = new_root;
|
/third_party/boost/boost/intrusive/ |
D | bstree_algorithms.hpp | 1302 node_ptr new_root = clone_subtree in clone() local 1306 NodeTraits::set_parent(target_header, new_root); in clone() 1426 node_ptr new_root = NodeTraits::get_right(super_root); in rebalance_subtree() local 1431 NodeTraits::set_parent(super_root, new_root); in rebalance_subtree() 1434 NodeTraits::set_right(super_root, new_root); in rebalance_subtree() 1438 NodeTraits::set_left(super_root, new_root); in rebalance_subtree() 1440 return new_root; in rebalance_subtree()
|
/third_party/skia/third_party/externals/freetype/src/psaux/ |
D | cffdecode.c | 1759 FT_Fixed new_root; in cff_decoder_parse_charstrings() local 1764 new_root = ( root + FT_DivFix( args[0], root ) + 1 ) >> 1; in cff_decoder_parse_charstrings() 1765 if ( new_root == root ) in cff_decoder_parse_charstrings() 1767 root = new_root; in cff_decoder_parse_charstrings() 1769 args[0] = new_root; in cff_decoder_parse_charstrings()
|
D | psintrp.c | 2280 FT_Fixed new_root; in cf2_interpT2CharString() local 2286 new_root = ( root + FT_DivFix( arg, root ) + 1 ) >> 1; in cf2_interpT2CharString() 2287 if ( new_root == root ) in cf2_interpT2CharString() 2289 root = new_root; in cf2_interpT2CharString() 2291 arg = new_root; in cf2_interpT2CharString()
|
/third_party/mindspore/mindspore/ccsrc/minddata/dataset/util/ |
D | btree_impl.tpp | 469 InnerNode *new_root = nullptr; 470 rc = AllocateInner(&new_root); 472 rc = new_root->InsertIntoSlot(0, new_key, new_child); 476 new_root->data_[0] = root_; 477 root_ = new_root;
|
/third_party/freetype/src/psaux/ |
D | cffdecode.c | 1759 FT_Fixed new_root; in cff_decoder_parse_charstrings() local 1764 new_root = ( root + FT_DivFix( args[0], root ) + 1 ) >> 1; in cff_decoder_parse_charstrings() 1765 if ( new_root == root ) in cff_decoder_parse_charstrings() 1767 root = new_root; in cff_decoder_parse_charstrings() 1769 args[0] = new_root; in cff_decoder_parse_charstrings()
|
D | psintrp.c | 2277 FT_Fixed new_root; in cf2_interpT2CharString() local 2283 new_root = ( root + FT_DivFix( arg, root ) + 1 ) >> 1; in cf2_interpT2CharString() 2284 if ( new_root == root ) in cf2_interpT2CharString() 2286 root = new_root; in cf2_interpT2CharString() 2288 arg = new_root; in cf2_interpT2CharString()
|
/third_party/flutter/skia/third_party/externals/freetype/src/psaux/ |
D | cffdecode.c | 1757 FT_Fixed new_root; in cff_decoder_parse_charstrings() local 1762 new_root = ( root + FT_DivFix( args[0], root ) + 1 ) >> 1; in cff_decoder_parse_charstrings() 1763 if ( new_root == root ) in cff_decoder_parse_charstrings() 1765 root = new_root; in cff_decoder_parse_charstrings() 1767 args[0] = new_root; in cff_decoder_parse_charstrings()
|
D | psintrp.c | 2277 FT_Fixed new_root; in cf2_interpT2CharString() local 2283 new_root = ( root + FT_DivFix( arg, root ) + 1 ) >> 1; in cf2_interpT2CharString() 2284 if ( new_root == root ) in cf2_interpT2CharString() 2286 root = new_root; in cf2_interpT2CharString() 2288 arg = new_root; in cf2_interpT2CharString()
|
/third_party/skia/third_party/externals/harfbuzz/src/ |
D | hb-repacker.hh | 1063 for (unsigned new_root : roots) in _try_isolating_subgraphs() local 1064 sorted_graph.move_to_new_space (new_root); in _try_isolating_subgraphs()
|
/third_party/grpc/src/core/lib/iomgr/ |
D | ev_epollex_linux.cc | 1072 grpc_pollset_worker* new_root = worker->pollable_obj->root_worker; local 1073 GPR_ASSERT(new_root->initialized_cv); 1074 gpr_cv_signal(&new_root->cv);
|
/third_party/e2fsprogs/lib/ext2fs/ |
D | extent.c | 913 int new_root = 0; in extent_node_split() local 1002 new_root = 1; in extent_node_split() 1105 if (new_root) { in extent_node_split()
|
/third_party/abseil-cpp/absl/container/internal/ |
D | btree.h | 2484 node_type *new_root = iter.node; 2485 new_root->transfer_n(old_root->count(), new_root->start(), 2487 new_root->set_finish(old_root->finish()); 2490 mutable_root() = rightmost_ = new_root;
|
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/ |
D | btree.h | 2511 node_type *new_root = iter.node; 2512 new_root->transfer_n(old_root->count(), new_root->start(), 2514 new_root->set_finish(old_root->finish()); 2517 mutable_root() = rightmost_ = new_root;
|
/third_party/python/Doc/distutils/ |
D | apiref.rst | 1174 .. function:: change_root(new_root, pathname) 1176 Return *pathname* with *new_root* prepended. If *pathname* is relative, this is 1177 equivalent to ``os.path.join(new_root,pathname)`` Otherwise, it requires making
|