| /third_party/googletest/googlemock/src/ |
| H A D | gmock-matchers.cc | 77 // - An edge from each right_ node to sink
78 // - An edge from each left_ node to each right_ node, if the
98 // As an optimization, there is a second vector<int> called right_ which
129 right_(graph_->RhsSize(), kUnused) {} in MaxBipartiteMatchState()
193 // right_[irhs] == kUnused means that there is residual flow from in TryAugment()
200 if (right_[irhs] == kUnused || TryAugment(right_[irhs], seen)) { in TryAugment()
201 // Add flow from left_[ilhs] to right_[irhs]. in TryAugment()
203 right_[irhs] = ilhs; in TryAugment()
212 // (i.e. an element) and each element of right_ i
223 ::std::vector<size_t> right_; global() member in testing::internal::MaxBipartiteMatchState
[all...] |
| /third_party/node/deps/v8/src/compiler/ |
| H A D | js-type-hint-lowering.cc | 73 right_(right), in JSSpeculativeBinopBuilder()
175 std::swap(left_, right_); // a > b => b < a in SpeculativeCompareOp()
180 std::swap(left_, right_); // a >= b => b <= a in SpeculativeCompareOp()
196 return graph()->NewNode(op, left_, right_, effect_, control_); in BuildSpeculativeOperation()
249 Node* right_; member in v8::internal::compiler::final
|
| H A D | node-matchers.h | 292 : NodeMatcher(node), left_(InputAt(0)), right_(InputAt(1)) { in BinopMatcher()
296 : NodeMatcher(node), left_(InputAt(0)), right_(InputAt(1)) { in BinopMatcher()
304 const Right& right() const { return right_; } in right()
322 std::swap(left_, right_); in SwapInputs()
338 Right right_; member
|
| /third_party/node/deps/v8/src/ast/ |
| H A D | ast.cc | 861 return MatchSmiLiteralOperation(left_, right_, subexpr, literal) || in IsSmiLiteralOperation()
863 MatchSmiLiteralOperation(right_, left_, subexpr, literal)); in IsSmiLiteralOperation()
885 return MatchLiteralCompareTypeof(left_, op(), right_, expr, literal) || in IsLiteralCompareTypeof()
886 MatchLiteralCompareTypeof(right_, op(), left_, expr, literal); in IsLiteralCompareTypeof()
911 return MatchLiteralCompareUndefined(left_, op(), right_, expr) || in IsLiteralCompareUndefined()
912 MatchLiteralCompareUndefined(right_, op(), left_, expr); in IsLiteralCompareUndefined()
926 return MatchLiteralCompareNull(left_, op(), right_, expr) || in IsLiteralCompareNull()
927 MatchLiteralCompareNull(right_, op(), left_, expr); in IsLiteralCompareNull()
|
| H A D | ast.h | 1851 Expression* right() const { return right_; } in right()
1862 : Expression(pos, kBinaryOperation), left_(left), right_(right) { in BinaryOperation()
1868 Expression* right_; member in v8::internal::final
1962 Expression* right() const { return right_; } in right()
1975 : Expression(pos, kCompareOperation), left_(left), right_(right) { in CompareOperation()
1981 Expression* right_; member in v8::internal::final
|
| /third_party/gn/src/gn/ |
| H A D | parse_tree.h | 250 const ParseNode* right() const { return right_.get(); } in right()
252 right_ = std::move(right); in set_right()
260 std::unique_ptr<ParseNode> right_; member in BinaryOpNode
|
| H A D | parse_tree.cc | 504 return ExecuteBinaryOperator(scope, this, left_.get(), right_.get(), err); in Execute()
508 return left_->GetRange().Union(right_->GetRange()); in GetRange()
520 child.GetList().push_back(right_->GetJSONNode()); in GetJSONNode()
532 ret->right_ = ParseNode::BuildFromJSON(children[1]); in NewFromJSON()
|
| /third_party/node/deps/v8/src/compiler/backend/arm/ |
| H A D | code-generator-arm.cc | 245 : OutOfLineCode(gen), result_(result), left_(left), right_(right) {} in OutOfLineFloatMin()
247 void Generate() final { __ FloatMinOutOfLine(result_, left_, right_); }
252 T const right_; member in v8::internal::compiler::__anon14228::final
261 : OutOfLineCode(gen), result_(result), left_(left), right_(right) {} in OutOfLineFloatMax()
263 void Generate() final { __ FloatMaxOutOfLine(result_, left_, right_); }
268 T const right_; member in v8::internal::compiler::__anon14228::final
|
| /third_party/node/deps/v8/src/compiler/backend/arm64/ |
| H A D | instruction-selector-arm64.cc | 3781 right_(InputAt(1)) { in SimdAddOpMatcher()
3788 Node* right() const { return right_; } in right()
3792 if (right_->opcode() == opcode_) { in PutOpOnLeft()
3793 std::swap(left_, right_); in PutOpOnLeft()
3795 node()->ReplaceInput(1, right_); in PutOpOnLeft()
3800 Node* right_; member
|
| /third_party/skia/modules/skparagraph/src/ |
| H A D | TextLine.cpp | 614 bounds->left_, bounds->top_, bounds->right_, bounds->bottom_
|