Home
last modified time | relevance | path

Searched refs:node_ (Results 1 – 25 of 59) sorted by relevance

123

/third_party/python/Python/
Dast_opt.c404 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/
Ddom_node_impl.cc36 : 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/skia/third_party/externals/spirv-tools/source/util/
Dilist.h74 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/spirv-tools/source/util/
Dilist.h74 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/
Dilist.h74 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/
Dosr_accessibility_node_win.cc217 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 …]
Dosr_accessibility_node_mac.mm249 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/
Dcord_rep_btree_navigator.h147 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 …]
Dcord_rep_btree_navigator.cc69 CordRepBtree* node = node_[0]; in Skip()
81 node = node_[height]; in Skip()
92 node_[--height] = node; in Skip()
110 CordRepBtree* node = node_[0]; in Read()
139 node = node_[height]; in Read()
156 node_[--height] = node; in Read()
/third_party/gn/src/gn/
Dhash_table_base.h306 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 …]
Dbuilder_record_map.h62 const BuilderRecord& operator*() const { return *node_->record; }
63 BuilderRecord& operator*() { return *node_->record; }
65 const BuilderRecord* operator->() const { return node_->record; }
66 BuilderRecord* operator->() { return node_->record; }
/third_party/skia/third_party/externals/spirv-tools/source/opt/
Dscalar_analysis.h179 : 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 …]
Dscalar_analysis_simplification.cpp83 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/spirv-tools/source/opt/
Dscalar_analysis.h179 : 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 …]
Dscalar_analysis_simplification.cpp83 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()
Dinstruction_list.cpp24 i.release()->InsertBefore(node_); in InsertBefore()
32 i.get()->InsertBefore(node_); in InsertBefore()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
Dscalar_analysis.h179 : 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 …]
Dscalar_analysis_simplification.cpp83 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()
Dinstruction_list.cpp24 i.release()->InsertBefore(node_); in InsertBefore()
32 i.get()->InsertBefore(node_); in InsertBefore()
/third_party/node/deps/v8/src/compiler/
Djs-typed-lowering.cc39 : lowering_(lowering), node_(node) {} in JSBinopReduction()
42 DCHECK_EQ(1, node_->op()->EffectOutputCount()); in GetCompareNumberOperationHint()
43 switch (GetCompareOperationHint(node_)) { in GetCompareNumberOperationHint()
70 DCHECK_EQ(1, node_->op()->EffectOutputCount()); in IsInternalizedStringCompareOperation()
71 return (GetCompareOperationHint(node_) == in IsInternalizedStringCompareOperation()
77 DCHECK_EQ(1, node_->op()->EffectOutputCount()); in IsReceiverCompareOperation()
78 return (GetCompareOperationHint(node_) == in IsReceiverCompareOperation()
84 DCHECK_EQ(1, node_->op()->EffectOutputCount()); in IsReceiverOrNullOrUndefinedCompareOperation()
85 return (GetCompareOperationHint(node_) == in IsReceiverOrNullOrUndefinedCompareOperation()
91 DCHECK_EQ(1, node_->op()->EffectOutputCount()); in IsStringCompareOperation()
[all …]
Dnode.h119 explicit UseEdges(Node* node) : node_(node) {} in UseEdges()
122 Node* node_;
137 explicit Uses(Node* node) : node_(node) {} in Uses()
140 Node* node_;
167 ZoneNodePtr node_; member
200 : reinterpret_cast<OutOfLineInputs*>(start)->node_; in from()
321 explicit constexpr NodeWrapper(Node* node) : node_(node) {} in NodeWrapper()
322 operator Node*() const { return node_; }
323 Node* operator->() const { return node_; }
326 Node* node() const { return node_; } in node()
[all …]
/third_party/node/deps/v8/src/maglev/
Dmaglev-graph-printer.h53 : graph_labeller_(graph_labeller), node_(node) {} in PrintNode()
59 const NodeBase* node_; variable
67 : graph_labeller_(graph_labeller), node_(node) {} in PrintNodeLabel()
73 const Node* node_; variable
/third_party/protobuf/src/google/protobuf/
Dmap.h449 iterator_base() : node_(nullptr), m_(nullptr), bucket_index_(0) {}
460 : node_(it.node_), m_(it.m_), bucket_index_(it.bucket_index_) {}
463 : node_(n), m_(m), bucket_index_(index) {}
466 : node_(NodeFromTreeIterator(tree_it)), m_(m), bucket_index_(index) {
477 node_ = nullptr;
481 node_ = static_cast<Node*>(m_->table_[bucket_index_]);
486 node_ = NodeFromTreeIterator(tree->begin());
492 reference operator*() const { return node_->kv; }
496 return a.node_ == b.node_;
499 return a.node_ != b.node_;
[all …]
/third_party/node/deps/v8/src/codegen/
Dtnode.h360 TNode(const TNode<U>& other) : node_(other) {
363 TNode(const TNode& other) : node_(other) { LazyTemplateChecks(); }
367 DCHECK_NOT_NULL(other.node_);
368 node_ = other.node_;
372 operator compiler::Node*() const { return node_; }
377 explicit TNode(compiler::Node* node) : node_(node) { LazyTemplateChecks(); }
383 compiler::Node* node_;
/third_party/node/test/cctest/
Dtest_util.cc18 struct Item { node::ListNode<Item> node_; }; in TEST() member
19 typedef node::ListHead<Item, &Item::node_> List; in TEST()
25 EXPECT_TRUE(one.node_.IsEmpty()); in TEST()
29 EXPECT_FALSE(one.node_.IsEmpty()); in TEST()
54 EXPECT_TRUE(one.node_.IsEmpty()); in TEST()
66 EXPECT_TRUE(two.node_.IsEmpty()); in TEST()

123