/third_party/python/Python/ |
D | ast_opt.c | 404 static int astfold_mod(mod_ty node_, PyArena *ctx_, _PyASTOptimizeState *state); 405 static int astfold_stmt(stmt_ty node_, PyArena *ctx_, _PyASTOptimizeState *state); 406 static int astfold_expr(expr_ty node_, PyArena *ctx_, _PyASTOptimizeState *state); 407 static int astfold_arguments(arguments_ty node_, PyArena *ctx_, _PyASTOptimizeState *state); 408 static int astfold_comprehension(comprehension_ty node_, PyArena *ctx_, _PyASTOptimizeState *state); 409 static int astfold_keyword(keyword_ty node_, PyArena *ctx_, _PyASTOptimizeState *state); 410 static int astfold_arg(arg_ty node_, PyArena *ctx_, _PyASTOptimizeState *state); 411 static int astfold_withitem(withitem_ty node_, PyArena *ctx_, _PyASTOptimizeState *state); 412 static int astfold_excepthandler(excepthandler_ty node_, PyArena *ctx_, _PyASTOptimizeState *state); 413 static int astfold_match_case(match_case_ty node_, PyArena *ctx_, _PyASTOptimizeState *state); [all …]
|
/third_party/cef/libcef/renderer/ |
D | dom_node_impl.cc | 36 : document_(document), node_(node) {} in CefDOMNodeImpl() 41 if (document_.get() && !node_.IsNull()) { in ~CefDOMNodeImpl() 43 document_->RemoveNode(node_); in ~CefDOMNodeImpl() 51 return blink_glue::GetNodeType(node_); in GetType() 58 return node_.IsTextNode(); in IsText() 65 return node_.IsElementNode(); in IsElement() 73 if (node_.IsContentEditable()) in IsEditable() 76 if (node_.IsElementNode()) { in IsEditable() 77 const WebElement& element = node_.ToConst<WebElement>(); in IsEditable() 101 if (node_.IsElementNode()) { in IsFormControlElement() [all …]
|
/third_party/mindspore/mindspore/ccsrc/ps/core/ |
D | node_recovery.cc | 27 MS_ERROR_IF_NULL_W_RET_VAL(node_, false); in Recover() 30 node_->set_worker_num(worker_num); in Recover() 32 node_->set_worker_num(PSContext::instance()->cluster_config().initial_worker_num); in Recover() 38 node_->set_server_num(server_num); in Recover() 40 node_->set_server_num(PSContext::instance()->cluster_config().initial_server_num); in Recover() 46 node_->set_scheduler_ip(scheduler_ip); in Recover() 48 node_->set_scheduler_ip(PSContext::instance()->cluster_config().scheduler_host); in Recover() 54 node_->set_scheduler_port(scheduler_port); in Recover() 56 node_->set_scheduler_port(PSContext::instance()->cluster_config().scheduler_port); in Recover() 58 …MS_LOG(INFO) << "The worker num:" << node_->worker_num() << ", the server num:" << node_->server_n… in Recover() [all …]
|
D | follower_scaler.cc | 24 : node_(node), scaling_state_(NodeScaleState::kNormal), running_(true) { in FollowerScaler() 121 MS_EXCEPTION_IF_NULL(node_); in RegisterScaleEventCallbacks() 122 …node_->RegisterEventCallback(core::ClusterEvent::READY_FOR_SCALE_OUT, ready_for_scale_out_event_ca… in RegisterScaleEventCallbacks() 123 …node_->RegisterEventCallback(core::ClusterEvent::READY_FOR_SCALE_IN, ready_for_scale_in_event_call… in RegisterScaleEventCallbacks() 124 …node_->RegisterEventCallback(core::ClusterEvent::CLUSTER_SCALE_OUT_DONE, scale_out_done_event_call… in RegisterScaleEventCallbacks() 125 …node_->RegisterEventCallback(core::ClusterEvent::CLUSTER_SCALE_IN_DONE, scale_in_done_event_callba… in RegisterScaleEventCallbacks() 135 node_->set_ready_for_scale_out(); in ProcessBeforeScaleOut() 145 node_->set_ready_for_scale_in(); in ProcessBeforeScaleIn() 156 node_->set_scale_out_done(); in ProcessAfterScaleOut() 167 node_->set_scale_in_done(); in ProcessAfterScaleIn()
|
D | leader_scaler.cc | 24 MS_EXCEPTION_IF_NULL(node_); in ScaleOutAsync() 33 …if (!node_->SendMessageSync(client, message_meta, Protos::PROTOBUF, scale_out_message.SerializeAsS… in ScaleOutAsync() 44 MS_EXCEPTION_IF_NULL(node_); in ScaleInAsync() 54 …if (!node_->SendMessageSync(client, message_meta, Protos::PROTOBUF, scale_in_message.SerializeAsSt… in ScaleInAsync()
|
/third_party/spirv-tools/source/util/ |
D | ilist.h | 74 iterator_template(const iterator_template& i) : node_(i.node_) {} in iterator_template() 77 node_ = node_->next_node_; 82 node_ = node_->previous_node_; 87 node_ = i.node_; 91 T& operator*() const { return *node_; } 92 T* operator->() const { return node_; } 96 return lhs.node_ == rhs.node_; 113 this->node_->previous_node_->next_node_ = first_node; in MoveBefore() 114 first_node->previous_node_ = this->node_->previous_node_; in MoveBefore() 116 last_node->next_node_ = this->node_; in MoveBefore() [all …]
|
/third_party/skia/third_party/externals/spirv-tools/source/util/ |
D | ilist.h | 74 iterator_template(const iterator_template& i) : node_(i.node_) {} in iterator_template() 77 node_ = node_->next_node_; 82 node_ = node_->previous_node_; 87 node_ = i.node_; 91 T& operator*() const { return *node_; } 92 T* operator->() const { return node_; } 96 return lhs.node_ == rhs.node_; 113 this->node_->previous_node_->next_node_ = first_node; in MoveBefore() 114 first_node->previous_node_ = this->node_->previous_node_; in MoveBefore() 116 last_node->next_node_ = this->node_; in MoveBefore() [all …]
|
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/util/ |
D | ilist.h | 74 iterator_template(const iterator_template& i) : node_(i.node_) {} in iterator_template() 77 node_ = node_->next_node_; 82 node_ = node_->previous_node_; 87 node_ = i.node_; 91 T& operator*() const { return *node_; } 92 T* operator->() const { return node_; } 96 return lhs.node_ == rhs.node_; 113 this->node_->previous_node_->next_node_ = first_node; in MoveBefore() 114 first_node->previous_node_ = this->node_->previous_node_; in MoveBefore() 116 last_node->next_node_ = this->node_; in MoveBefore() [all …]
|
/third_party/cef/tests/cefclient/browser/ |
D | osr_accessibility_node_win.cc | 217 CefIAccessible(OsrAXNode* node) : ref_count_(0), node_(node) {} in CefIAccessible() 221 void MarkDestroyed() { node_ = nullptr; } in MarkDestroyed() 229 OsrAXNode* node_; member 262 if (node_) in STDMETHODIMP_() 263 node_->Destroy(); in STDMETHODIMP_() 275 HRESULT retCode = DATACHECK(node_); in get_accParent() 278 CefNativeAccessible* parent = node_->GetParentAccessibleObject(); in get_accParent() 281 HWND hWnd = ::GetParent(node_->GetWindowHandle()); in get_accParent() 302 HRESULT retCode = DATACHECK(node_); in get_accChildCount() 305 *pcountChildren = node_->GetChildCount(); in get_accChildCount() [all …]
|
D | osr_accessibility_node_mac.mm | 249 client::OsrAXNode* node_; field 259 node_ = node; 260 parent_ = node_->GetParentAccessibleObject(); 262 parent_ = node_->GetWindowHandle(); 275 return (node_ == other->node_); 285 return AxRoleToNSAxRole(node_->AxRole()); 289 std::string desc = node_->AxDescription(); 294 std::string desc = node_->AxName(); 299 std::string desc = node_->AxValue(); 304 CefRefPtr<CefBrowser> browser = node_->GetBrowser(); [all …]
|
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
D | cord_rep_btree_navigator.h | 147 CordRepBtree* node_[CordRepBtree::kMaxHeight]; variable 154 return height_ >= 0 ? node_[height_] : nullptr; in btree() 159 return node_[0]->Edge(index_[0]); in Current() 178 node_[height] = tree; in Init() 182 node_[height] = tree; in Init() 186 return node_[0]->Edge(index); in Init() 193 CordRepBtree* edge = node_[height]; in Seek() 199 node_[height] = edge; in Seek() 211 node_[height_] = tree; in InitOffset() 216 CordRepBtree* edge = node_[0]; in Next() [all …]
|
/third_party/gn/src/gn/ |
D | hash_table_base.h | 306 Node& operator*() { return *node_; } 307 const Node& operator*() const { return *node_; } 309 Node* operator->() { return node_; } 310 const Node* operator->() const { return node_; } 313 return node_ == other.node_; 317 return node_ != other.node_; 322 node_++; 323 while (node_ < node_limit_ && !node_->is_valid()) 324 node_++; 337 bool valid() const { return node_ != node_limit_; } in valid() [all …]
|
/third_party/mindspore/mindspore/core/utils/ |
D | symbolic.h | 35 : node_(node), abstract_(abstract) {} in SymbolicKeyInstance() 38 AnfNodePtr node() const { return node_; } in node() 41 return (*node_ == *other.node_) && (*abstract_ == *other.abstract_); 44 std::size_t hash() const override { return std::hash<AnfNodePtr>{}(node_); } in hash() 51 os << "[Key][" << inst->node_->type_name() << "]" << inst->node_->ToString(); 56 …return node_ == nullptr ? "Invalid node" : "[Key][" + node_->type_name() + "]" + node_->ToString(); in ToString() 72 AnfNodePtr node_;
|
/third_party/mindspore/mindspore/lite/micro/coder/opcoders/ |
D | op_coder_builder.cc | 27 MS_CHECK_PTR_RET_NULL(node_->primitive_); in build() 28 int primitive_type = GetPrimitiveType(node_->primitive_, schema_version); in build() 32 MS_LOG(ERROR) << "caught unsupported layer: " << node_->name_; in build() 43 creator_func(inputs_, outputs_, node_, node_index_++, target_, schema_version); in build() 45 MS_LOG(ERROR) << "create op_coder failed: " << node_->name_ << " primitive type: " in build() 73 this->node_ = node; in node()
|
/third_party/spirv-tools/source/opt/ |
D | scalar_analysis.h | 179 : node_(node->GetParentAnalysis()->SimplifyExpression(node)), in SExpression() 182 inline operator SENode*() const { return node_; } 183 inline SENode* operator->() const { return node_; } 184 const SENode& operator*() const { return *node_; } 218 SENode* node_; 223 return scev_->CreateAddNode(node_, rhs); 233 return *this + rhs.node_; 237 return scev_->CreateNegation(node_); 251 return *this - rhs.node_; 255 return scev_->CreateMultiplyNode(node_, rhs); [all …]
|
D | scalar_analysis_simplification.cpp | 83 node_(node_to_simplify), in SENodeSimplifyImpl() 141 SENode* node_; member in spvtools::opt::SENodeSimplifyImpl 201 if (node_->GetType() != SENode::Add && node_->GetType() != SENode::Multiply && in Simplify() 202 node_->GetType() != SENode::Negative) in Simplify() 203 return node_; in Simplify() 208 node_ = simplified_polynomial; in Simplify() 316 std::unique_ptr<SENode> new_add{new SEAddNode(node_->GetParentAnalysis())}; in SimplifyPolynomial() 319 GatherAccumulatorsFromChildNodes(new_add.get(), node_, false); in SimplifyPolynomial() 485 std::unique_ptr<SENode> new_add{new SEAddNode(node_->GetParentAnalysis())}; in EliminateZeroCoefficientRecurrents() 496 const std::vector<SENode*>& children = node_->GetChildren(); in SimplifyRecurrentAddExpression()
|
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/ |
D | scalar_analysis.h | 179 : node_(node->GetParentAnalysis()->SimplifyExpression(node)), in SExpression() 182 inline operator SENode*() const { return node_; } 183 inline SENode* operator->() const { return node_; } 184 const SENode& operator*() const { return *node_; } 218 SENode* node_; 223 return scev_->CreateAddNode(node_, rhs); 233 return *this + rhs.node_; 237 return scev_->CreateNegation(node_); 251 return *this - rhs.node_; 255 return scev_->CreateMultiplyNode(node_, rhs); [all …]
|
D | scalar_analysis_simplification.cpp | 83 node_(node_to_simplify), in SENodeSimplifyImpl() 141 SENode* node_; member in spvtools::opt::SENodeSimplifyImpl 201 if (node_->GetType() != SENode::Add && node_->GetType() != SENode::Multiply && in Simplify() 202 node_->GetType() != SENode::Negative) in Simplify() 203 return node_; in Simplify() 208 node_ = simplified_polynomial; in Simplify() 316 std::unique_ptr<SENode> new_add{new SEAddNode(node_->GetParentAnalysis())}; in SimplifyPolynomial() 319 GatherAccumulatorsFromChildNodes(new_add.get(), node_, false); in SimplifyPolynomial() 485 std::unique_ptr<SENode> new_add{new SEAddNode(node_->GetParentAnalysis())}; in EliminateZeroCoefficientRecurrents() 496 const std::vector<SENode*>& children = node_->GetChildren(); in SimplifyRecurrentAddExpression()
|
/third_party/skia/third_party/externals/spirv-tools/source/opt/ |
D | scalar_analysis.h | 179 : node_(node->GetParentAnalysis()->SimplifyExpression(node)), in SExpression() 182 inline operator SENode*() const { return node_; } 183 inline SENode* operator->() const { return node_; } 184 const SENode& operator*() const { return *node_; } 218 SENode* node_; 223 return scev_->CreateAddNode(node_, rhs); 233 return *this + rhs.node_; 237 return scev_->CreateNegation(node_); 251 return *this - rhs.node_; 255 return scev_->CreateMultiplyNode(node_, rhs); [all …]
|
D | scalar_analysis_simplification.cpp | 83 node_(node_to_simplify), in SENodeSimplifyImpl() 141 SENode* node_; member in spvtools::opt::SENodeSimplifyImpl 201 if (node_->GetType() != SENode::Add && node_->GetType() != SENode::Multiply && in Simplify() 202 node_->GetType() != SENode::Negative) in Simplify() 203 return node_; in Simplify() 208 node_ = simplified_polynomial; in Simplify() 316 std::unique_ptr<SENode> new_add{new SEAddNode(node_->GetParentAnalysis())}; in SimplifyPolynomial() 319 GatherAccumulatorsFromChildNodes(new_add.get(), node_, false); in SimplifyPolynomial() 485 std::unique_ptr<SENode> new_add{new SEAddNode(node_->GetParentAnalysis())}; in EliminateZeroCoefficientRecurrents() 496 const std::vector<SENode*>& children = node_->GetChildren(); in SimplifyRecurrentAddExpression()
|
/third_party/mindspore/mindspore/ccsrc/backend/kernel_compiler/cpu/ |
D | masked_select_cpu_kernel.cc | 66 auto node_ = node_wpt_.lock(); in Launch() local 67 if (!node_) { in Launch() 72 size_t output_num = AnfAlgo::GetOutputTensorNum(node_); in Launch() 75 dtypes[i] = AnfAlgo::GetOutputDeviceDataType(node_, i); in Launch() 77 AnfAlgo::SetOutputInferTypeAndShape(dtypes, {out_shape}, node_.get()); in Launch()
|
D | unique_cpu_kernel.cc | 57 auto node_ = node_wpt_.lock(); in Launch() local 58 if (!node_) { in Launch() 63 size_t output_num = AnfAlgo::GetOutputTensorNum(node_); in Launch() 66 dtypes[i] = AnfAlgo::GetOutputDeviceDataType(node_, i); in Launch() 68 …tOutputInferTypeAndShape(dtypes, {out_shape, AnfAlgo::GetOutputInferShape(node_, 1)}, node_.get()); in Launch()
|
D | pad_and_shift_cpu_kernel.cc | 84 auto node_ = node_wpt_.lock(); in LaunchKernel() local 85 if (!node_) { in LaunchKernel() 88 auto output_nums = AnfAlgo::GetOutputTensorNum(node_); in LaunchKernel() 91 dtypes[i] = AnfAlgo::GetOutputDeviceDataType(node_, i); in LaunchKernel() 93 AnfAlgo::SetOutputInferTypeAndShape(dtypes, {out_shape}, node_.get()); in LaunchKernel()
|
/third_party/boost/boost/unordered/detail/ |
D | implementation.hpp | 1944 node_pointer node_; member 1946 node_constructor(node_allocator& n) : alloc_(n), node_() {} in node_constructor() 1955 BOOST_ASSERT(node_); in release() 1956 node_pointer p = node_; in release() 1957 node_ = node_pointer(); in release() 1963 BOOST_ASSERT(!node_); in reclaim() 1964 node_ = p; in reclaim() 1966 node_allocator_traits, alloc_, node_->value_ptr()); in reclaim() 1976 if (node_) { in ~node_constructor() 1977 boost::unordered::detail::func::destroy(boost::to_address(node_)); in ~node_constructor() [all …]
|
/third_party/boost/libs/intrusive/test/ |
D | itestvalue.hpp | 39 typename Hooks::member_hook_type node_; member 62 this->node_ = src.node_; in operator =() 73 node_.swap_nodes(other.node_); in swap_nodes() 82 node_.is_linked() || in is_linked() 252 , &value_type::node_
|