Home
last modified time | relevance | path

Searched refs:node_ (Results 1 - 25 of 58) sorted by relevance

123

/third_party/python/Python/
H A Dast_opt.c628 static int astfold_mod(mod_ty node_, PyArena *ctx_, _PyASTOptimizeState *state);
629 static int astfold_stmt(stmt_ty node_, PyArena *ctx_, _PyASTOptimizeState *state);
630 static int astfold_expr(expr_ty node_, PyArena *ctx_, _PyASTOptimizeState *state);
631 static int astfold_arguments(arguments_ty node_, PyArena *ctx_, _PyASTOptimizeState *state);
632 static int astfold_comprehension(comprehension_ty node_, PyArena *ctx_, _PyASTOptimizeState *state);
633 static int astfold_keyword(keyword_ty node_, PyArena *ctx_, _PyASTOptimizeState *state);
634 static int astfold_arg(arg_ty node_, PyArena *ctx_, _PyASTOptimizeState *state);
635 static int astfold_withitem(withitem_ty node_, PyArena *ctx_, _PyASTOptimizeState *state);
636 static int astfold_excepthandler(excepthandler_ty node_, PyArena *ctx_, _PyASTOptimizeState *state);
637 static int astfold_match_case(match_case_ty node_, PyAren
683 astfold_mod(mod_ty node_, PyArena *ctx_, _PyASTOptimizeState *state) astfold_mod() argument
705 astfold_expr(expr_ty node_, PyArena *ctx_, _PyASTOptimizeState *state) astfold_expr() argument
828 astfold_keyword(keyword_ty node_, PyArena *ctx_, _PyASTOptimizeState *state) astfold_keyword() argument
835 astfold_comprehension(comprehension_ty node_, PyArena *ctx_, _PyASTOptimizeState *state) astfold_comprehension() argument
846 astfold_arguments(arguments_ty node_, PyArena *ctx_, _PyASTOptimizeState *state) astfold_arguments() argument
859 astfold_arg(arg_ty node_, PyArena *ctx_, _PyASTOptimizeState *state) astfold_arg() argument
868 astfold_stmt(stmt_ty node_, PyArena *ctx_, _PyASTOptimizeState *state) astfold_stmt() argument
995 astfold_excepthandler(excepthandler_ty node_, PyArena *ctx_, _PyASTOptimizeState *state) astfold_excepthandler() argument
1009 astfold_withitem(withitem_ty node_, PyArena *ctx_, _PyASTOptimizeState *state) astfold_withitem() argument
1017 astfold_pattern(pattern_ty node_, PyArena *ctx_, _PyASTOptimizeState *state) astfold_pattern() argument
1063 astfold_match_case(match_case_ty node_, PyArena *ctx_, _PyASTOptimizeState *state) astfold_match_case() argument
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/util/
H A Dilist.h74 iterator_template(const iterator_template& i) : node_(i.node_) {} in iterator_template()
77 node_ = node_->next_node_; in operator ++()
82 node_ = node_->previous_node_; in operator --()
87 node_ = i.node_; in operator =()
91 T& operator*() const { return *node_; } in operator *()
92 T* operator->() const { return node_; } in operator ->()
139 T* node_; global() member in spvtools::utils::IntrusiveList::iterator_template
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/util/
H A Dilist.h74 iterator_template(const iterator_template& i) : node_(i.node_) {} in iterator_template()
77 node_ = node_->next_node_; in operator ++()
82 node_ = node_->previous_node_; in operator --()
87 node_ = i.node_; in operator =()
91 T& operator*() const { return *node_; } in operator *()
92 T* operator->() const { return node_; } in operator ->()
139 T* node_; global() member in spvtools::utils::IntrusiveList::iterator_template
[all...]
/third_party/spirv-tools/source/util/
H A Dilist.h74 iterator_template(const iterator_template& i) : node_(i.node_) {} in iterator_template()
77 node_ = node_->next_node_; in operator ++()
82 node_ = node_->previous_node_; in operator --()
87 node_ = i.node_; in operator =()
91 T& operator*() const { return *node_; } in operator *()
92 T* operator->() const { return node_; } in operator ->()
139 T* node_; global() member in spvtools::utils::IntrusiveList::iterator_template
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dcord_rep_btree_navigator.h143 // `index_` and `node_` contain the navigation state as the 'path' to the
144 // current data edge which is at `node_[0]->Edge(index_[0])`. The contents
147 CordRepBtree* node_[CordRepBtree::kMaxHeight]; member in absl::cord_internal::CordRepBtreeNavigator
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_[heigh in Seek()
[all...]
H A 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/
H A Dhash_table_base.h278 // const Foo* operator->() { return node_->foo_ptr; }
279 // const Foo& operator*)) { return *(node_->foo_ptr); }
306 Node& operator*() { return *node_; } in operator *()
307 const Node& operator*() const { return *node_; } in operator *()
309 Node* operator->() { return node_; } in operator ->()
310 const Node* operator->() const { return node_; } in operator ->()
313 return node_ == other.node_; in operator ==()
317 return node_ != other.node_; in operator !=()
339 Node* node_ = nullptr; global() member
[all...]
H A Dbuilder_record_map.h62 const BuilderRecord& operator*() const { return *node_->record; } in operator *()
63 BuilderRecord& operator*() { return *node_->record; } in operator *()
65 const BuilderRecord* operator->() const { return node_->record; } in operator ->()
66 BuilderRecord* operator->() { return node_->record; } in operator ->()
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dscalar_analysis.h179 : node_(node->GetParentAnalysis()->SimplifyExpression(node)), in SExpression()
182 inline operator SENode*() const { return node_; } in operator SENode*()
183 inline SENode* operator->() const { return node_; } in operator ->()
184 const SENode& operator*() const { return *node_; } in operator *()
212 // Try to perform a division. Returns the pair <this.node_ / rhs, division
218 SENode* node_; member in spvtools::opt::SExpression
223 return scev_->CreateAddNode(node_, rhs); in operator +()
233 return *this + rhs.node_; in operator +()
237 return scev_->CreateNegation(node_); in operator -()
251 return *this - rhs.node_; in operator -()
[all...]
H A 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_ in EliminateZeroCoefficientRecurrents()
[all...]
H A 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/
H A Dscalar_analysis.h179 : node_(node->GetParentAnalysis()->SimplifyExpression(node)), in SExpression()
182 inline operator SENode*() const { return node_; } in operator SENode*()
183 inline SENode* operator->() const { return node_; } in operator ->()
184 const SENode& operator*() const { return *node_; } in operator *()
212 // Try to perform a division. Returns the pair <this.node_ / rhs, division
218 SENode* node_; member in spvtools::opt::SExpression
223 return scev_->CreateAddNode(node_, rhs); in operator +()
233 return *this + rhs.node_; in operator +()
237 return scev_->CreateNegation(node_); in operator -()
251 return *this - rhs.node_; in operator -()
[all...]
H A 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_ in EliminateZeroCoefficientRecurrents()
[all...]
H A Dinstruction_list.cpp24 i.release()->InsertBefore(node_); in InsertBefore()
32 i.get()->InsertBefore(node_); in InsertBefore()
/third_party/spirv-tools/source/opt/
H A Dscalar_analysis.h179 : node_(node->GetParentAnalysis()->SimplifyExpression(node)), in SExpression()
182 inline operator SENode*() const { return node_; } in operator SENode*()
183 inline SENode* operator->() const { return node_; } in operator ->()
184 const SENode& operator*() const { return *node_; } in operator *()
212 // Try to perform a division. Returns the pair <this.node_ / rhs, division
218 SENode* node_; member in spvtools::opt::SExpression
223 return scev_->CreateAddNode(node_, rhs); in operator +()
233 return *this + rhs.node_; in operator +()
237 return scev_->CreateNegation(node_); in operator -()
251 return *this - rhs.node_; in operator -()
[all...]
H A Dscalar_analysis_simplification.cpp82 node_(node_to_simplify), in SENodeSimplifyImpl()
140 SENode* node_; member in spvtools::opt::SENodeSimplifyImpl
200 if (node_->GetType() != SENode::Add && node_->GetType() != SENode::Multiply && in Simplify()
201 node_->GetType() != SENode::Negative) in Simplify()
202 return node_; in Simplify()
207 node_ = simplified_polynomial; in Simplify()
315 std::unique_ptr<SENode> new_add{new SEAddNode(node_->GetParentAnalysis())}; in SimplifyPolynomial()
318 GatherAccumulatorsFromChildNodes(new_add.get(), node_, false); in SimplifyPolynomial()
484 std::unique_ptr<SENode> new_add{new SEAddNode(node_ in EliminateZeroCoefficientRecurrents()
[all...]
H A Dinstruction_list.cpp24 i.release()->InsertBefore(node_); in InsertBefore()
32 i.get()->InsertBefore(node_); in InsertBefore()
/third_party/node/deps/v8/src/maglev/
H A Dmaglev-graph-printer.h53 : graph_labeller_(graph_labeller), node_(node) {} in PrintNode()
59 const NodeBase* node_; member in v8::internal::maglev::PrintNode
67 : graph_labeller_(graph_labeller), node_(node) {} in PrintNodeLabel()
73 const Node* node_; member in v8::internal::maglev::PrintNodeLabel
/third_party/node/deps/v8/src/compiler/
H A 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_ in IsStringCompareOperation()
407 Node* node_; // The original node. global() member in v8::internal::compiler::final
[all...]
H A Dnode.h119 explicit UseEdges(Node* node) : node_(node) {} in UseEdges()
122 Node* node_; member in v8::internal::compiler::final::final
137 explicit Uses(Node* node) : node_(node) {} in Uses()
140 Node* node_; member in v8::internal::compiler::final::final
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_; } in operator Node*()
323 Node* operator->() const { return node_; } in operator ->()
326 Node* node() const { return node_; } in node()
333 Node* node_; global() member in v8::internal::compiler::NodeWrapper
[all...]
H A Dstate-values-utils.h122 explicit StateValuesAccess(Node* node) : node_(node) {} in StateValuesAccess()
125 iterator begin() const { return iterator(node_); } in begin()
140 Node* node_; member in v8::internal::compiler::StateValuesAccess
/third_party/protobuf/src/google/protobuf/
H A Dmap.h443 // node_ is always correct. This is handy because the most common
444 // operations are operator* and operator-> and they only use node_.
445 // When node_ is set to a non-null value, all the other non-const fields
449 iterator_base() : node_(nullptr), m_(nullptr), bucket_index_(0) {} in iterator_base()
460 : node_(it.node_), m_(it.m_), bucket_index_(it.bucket_index_) {} in iterator_base()
463 : node_(n), m_(m), bucket_index_(index) {} in iterator_base()
466 : node_(NodeFromTreeIterator(tree_it)), m_(m), bucket_index_(index) { in iterator_base()
473 // If nothing non-empty is found then leave node_ == nullptr.
477 node_ in SearchFrom()
558 Node* node_; global() member in google::protobuf::Map::InnerMap::iterator_base
[all...]
/third_party/node/deps/v8/src/codegen/
H A Dtnode.h360 TNode(const TNode<U>& other) : node_(other) { in TNode()
363 TNode(const TNode& other) : node_(other) { LazyTemplateChecks(); } in TNode()
367 DCHECK_NOT_NULL(other.node_); in operator =()
368 node_ = other.node_; in operator =()
372 operator compiler::Node*() const { return node_; } in operator compiler::Node*()
377 explicit TNode(compiler::Node* node) : node_(node) { LazyTemplateChecks(); } in TNode()
383 compiler::Node* node_; member in v8::internal::TNode
/third_party/skia/third_party/externals/angle2/src/tests/deqp_support/
H A DtcuRandomOrderExecutor.h55 NodeStackEntry(TestNode *node_) : node(node_) {} in NodeStackEntry()
/third_party/node/deps/v8/src/interpreter/
H A Dcontrol-flow-builders.h45 node_(node), in BreakableControlFlowBuilder()
81 AstNode* node_; member in v8::internal::interpreter::BreakableControlFlowBuilder
274 node_(node), in ConditionalControlFlowBuilder()
301 AstNode* node_; member in v8::internal::interpreter::final

Completed in 17 milliseconds

123