Searched refs:newRight (Results 1 – 7 of 7) sorted by relevance
| /external/angle/src/compiler/translator/TranslatorMetalDirect/ |
| D | RewriteUnaddressableReferences.cpp | 343 TIntermTyped &newRight = traverse(rightNode, disableRight); in visitBinaryPre() local
347 if (&leftNode == &newLeft && &rightNode == &newRight) in visitBinaryPre()
351 return {*new TIntermBinary(op, &newLeft, &newRight), VisitBits::Neither}; in visitBinaryPre()
355 *new TIntermSequence{&newLeft, &newRight}), in visitBinaryPre()
|
| D | SeparateCompoundExpressions.cpp | 404 TIntermTyped *newRight = pullMappedExpr(right, true); in visitBinaryPost() local
405 TIntermBlock *rightBlock = &buildBlockWithTailAssign(*var, *newRight); in visitBinaryPost()
426 TIntermTyped *newRight = pullMappedExpr(right, isAssign); in visitBinaryPost() local
430 pushBinding(node, *newRight); in visitBinaryPost()
436 if (left == newLeft && right == newRight) in visitBinaryPost()
442 newNode = new TIntermBinary(op, newLeft, newRight); in visitBinaryPost()
|
| D | IntermRebuild.cpp | 573 auto *const newRight = traverseAnyAs<TIntermTyped>(*right); in traverseBinaryChildren() local
574 GUARD(newRight); in traverseBinaryChildren()
576 if (newLeft != left || newRight != right) in traverseBinaryChildren()
600 return TIntermBinary::CreateComma(newLeft, newRight, mCompiler.getShaderVersion()); in traverseBinaryChildren()
606 return new TIntermBinary(op, newLeft, newRight); in traverseBinaryChildren()
|
| /external/protobuf/java/core/src/main/java/com/google/protobuf/ |
| D | RopeByteString.java | 196 ByteString newRight = concatenateBytes(leftRope.right, right); in concatenate() local
197 return new RopeByteString(leftRope.left, newRight); in concatenate()
207 ByteString newRight = new RopeByteString(leftRope.right, right); in concatenate() local
208 return new RopeByteString(leftRope.left, newRight); in concatenate()
|
| /external/llvm-project/llvm/include/llvm/ADT/ |
| D | ImmutableSet.h | 484 TreeTy* createNode(TreeTy* newLeft, TreeTy* oldTree, TreeTy* newRight) {
485 return createNode(newLeft, getValue(oldTree), newRight);
588 TreeTy* newRight = removeMinBinding(R,OldNode);
589 return balanceTree(L, getValue(OldNode), newRight);
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
| D | ImmutableSet.h | 477 TreeTy* createNode(TreeTy* newLeft, TreeTy* oldTree, TreeTy* newRight) { in createNode() argument
478 return createNode(newLeft, getValue(oldTree), newRight); in createNode()
581 TreeTy* newRight = removeMinBinding(R,OldNode); in combineTrees() local
582 return balanceTree(L, getValue(OldNode), newRight); in combineTrees()
|
| /external/llvm/include/llvm/ADT/ |
| D | ImmutableSet.h | 477 TreeTy* createNode(TreeTy* newLeft, TreeTy* oldTree, TreeTy* newRight) { in createNode() argument
478 return createNode(newLeft, getValue(oldTree), newRight); in createNode()
581 TreeTy* newRight = removeMinBinding(R,OldNode); in combineTrees() local
582 return balanceTree(L, getValue(OldNode), newRight); in combineTrees()
|