/external/apache-xml/src/main/java/org/apache/xpath/compiler/ |
D | XPathParser.java | 215 m_ops.setOp(m_ops.getOp(OpMap.MAPINDEX_LENGTH), OpCodes.ENDOP); in initMatchPattern() 216 m_ops.setOp(OpMap.MAPINDEX_LENGTH, m_ops.getOp(OpMap.MAPINDEX_LENGTH)+1); in initMatchPattern() 749 int totalLen = m_ops.getOp(OpMap.MAPINDEX_LENGTH); in insertOp() 753 m_ops.setOp(i + length, m_ops.getOp(i)); in insertOp() 771 int totalLen = m_ops.getOp(OpMap.MAPINDEX_LENGTH); in appendOp() 805 int opPos = m_ops.getOp(OpMap.MAPINDEX_LENGTH); in OrExpr() 816 m_ops.getOp(OpMap.MAPINDEX_LENGTH) - opPos); in OrExpr() 832 int opPos = m_ops.getOp(OpMap.MAPINDEX_LENGTH); in AndExpr() 843 m_ops.getOp(OpMap.MAPINDEX_LENGTH) - opPos); in AndExpr() 865 int opPos = m_ops.getOp(OpMap.MAPINDEX_LENGTH); in EqualityExpr() [all …]
|
D | Compiler.java | 117 int op = getOp(opPos); in compile() 191 … new Object[]{ Integer.toString(getOp(opPos)) }); //"ERROR! Unknown op code: "+m_opMap[opPos]); in compile() 508 return (XString) getTokenQueue().elementAt(getOp(opPos)); in literal() 525 return (XNumber) getTokenQueue().elementAt(getOp(opPos)); in numberlit() 544 int nsPos = getOp(opPos); in variable() 549 = (java.lang.String) getTokenQueue().elementAt(getOp(opPos+1)); in variable() 687 for (i = 0; getOp(nextOpPos) == OpCodes.OP_LOCATIONPATHPATTERN; i++) in matchPattern() 698 for (i = 0; getOp(opPos) == OpCodes.OP_LOCATIONPATHPATTERN; i++) in matchPattern() 745 int axesType = getOp(opPos); in getWhatToShow() 746 int testType = getOp(opPos + 3); in getWhatToShow() [all …]
|
D | OpMap.java | 174 public int getOp(int opPos) in getOp() method in OpMap 213 int stepType = getOp(opPos); in getNextStepPos() 225 while (OpCodes.OP_PREDICATE == getOp(newOpPos)) in getNextStepPos() 230 stepType = getOp(newOpPos); in getNextStepPos()
|
/external/angle/src/compiler/translator/tree_util/ |
D | IntermNodePatternMatcher.cpp | 58 return node->getOp() == EOpIndexIndirect && !node->getLeft()->isArray() && in IsDynamicIndexingOfVectorOrMatrix() 72 if (node->isArray() && node->getOp() == EOpAssign && parentNode != nullptr && in matchInternal() 82 (node->getOp() == EOpLogicalOr || node->getOp() == EOpLogicalAnd)) in matchInternal() 94 if (node->getOp() == EOpArrayLength) in match() 138 (parentBinary->getOp() == EOpAssign || parentBinary->getOp() == EOpInitialize)); in match() 142 (BuiltInGroup::IsBuiltIn(node->getOp()) && in match() 143 !BuiltInGroup::IsMath(node->getOp()))) && in match() 152 if (node->getOp() == EOpConstruct) in match()
|
/external/angle/src/compiler/translator/tree_ops/d3d/ |
D | RewriteAtomicFunctionExpressions.cpp | 84 if (parentBinary && parentBinary->getOp() == EOpInitialize) in rewriteAtomicFunctionCallNode() 118 return (node->getOp() == EOpAtomicExchange || node->getOp() == EOpAtomicCompSwap) && in IsAtomicExchangeOrCompSwapNoReturnValue() 129 if (!BuiltInGroup::IsAtomicMemory(node->getOp()) || parentNode->getAsBlock()) in IsAtomicFunctionInsideExpression() 136 return !parentAsBinary || parentAsBinary->getOp() != EOpAssign; in IsAtomicFunctionInsideExpression() 143 if (BuiltInGroup::IsAtomicMemory(node->getOp()) && in visitAggregate()
|
D | RewriteExpressionsWithShaderStorageBlock.cpp | 185 if (IsCompoundAssignment(node->getOp())) in visitBinary() 196 new TIntermBinary(node->getOp(), tempSymbol->deepCopy(), rightNode->deepCopy()); in visitBinary() 208 new TIntermBinary(node->getOp(), node->getLeft(), rightNode->deepCopy()); in visitBinary() 220 else if (IsReadonlyBinaryOperatorNotInSSBOAccessChain(node->getOp()) && (leftSSBO || rightSSBO)) in visitBinary() 237 new TIntermBinary(node->getOp(), leftNode->deepCopy(), rightNode->deepCopy()); in visitBinary() 273 if (BuiltInGroup::IsAtomicMemory(node->getOp()) && in visitAggregate() 348 if (node->getOp() == EOpArrayLength) in visitUnary() 363 if (IsIncrementOrDecrementOperator(node->getOp())) in visitUnary() 368 TIntermUnary *newUnary = new TIntermUnary(node->getOp(), temp1->deepCopy(), nullptr); in visitUnary()
|
D | RecordUniformBlocksWithLargeArrayMember.cpp | 194 !(accessorAsBinary && (accessorAsBinary->getOp() == EOpIndexDirect || in visitSymbol() 195 accessorAsBinary->getOp() == EOpIndexIndirect))) in visitSymbol() 234 if (accessorAsBinary && (accessorAsBinary->getOp() == EOpIndexDirect || in visitSymbol() 235 accessorAsBinary->getOp() == EOpIndexIndirect)) in visitSymbol() 252 switch (node->getOp()) in visitBinary() 306 !(accessorAsBinary && (accessorAsBinary->getOp() == EOpIndexDirect || in visitBinary() 307 accessorAsBinary->getOp() == EOpIndexIndirect))) && in visitBinary() 322 if (accessorAsBinary && (accessorAsBinary->getOp() == EOpIndexDirect || in visitBinary() 323 accessorAsBinary->getOp() == EOpIndexIndirect)) in visitBinary()
|
D | SeparateExpressionsReturningArrays.cpp | 55 return new TIntermBinary(node->getOp(), node->getLeft(), node->getRight()); in CopyAssignmentNode() 67 ASSERT(node->getOp() == EOpAssign); in visitBinary() 95 ASSERT(node->isConstructor() || node->getOp() == EOpCallFunctionInAST); in visitAggregate()
|
D | ArrayReturnValueToOutParameter.cpp | 143 ASSERT(!node->isArray() || node->getOp() != EOpCallInternalRawFunction); in visitAggregate() 144 if (visit == PreVisit && node->isArray() && node->getOp() == EOpCallFunctionInAST) in visitAggregate() 211 if (node->getOp() == EOpAssign && node->getLeft()->isArray()) in visitBinary() 214 ASSERT(rightAgg == nullptr || rightAgg->getOp() != EOpCallInternalRawFunction); in visitBinary() 215 if (rightAgg != nullptr && rightAgg->getOp() == EOpCallFunctionInAST) in visitBinary()
|
/external/deqp-deps/glslang/glslang/MachineIndependent/ |
D | propagateNoContraction.cpp | 301 if (node->getOp() == glslang::EOpFunction) { in visitAggregate() 336 if (isAssignOperation(node->getOp())) { in visitUnary() 368 if (isAssignOperation(node->getOp())) { in visitBinary() 392 } else if (isDereferenceOperation(node->getOp())) { in visitBinary() 396 if (node->getOp() == glslang::EOpIndexDirectStruct) { in visitBinary() 490 assert(isAssignOperation(node->getOp())); in getPrecisenessAndRemainedAccessChain() 583 assert(isDereferenceOperation(node->getOp())); in visitBinary() 635 assert(isAssignOperation(BN->getOp())); in propagateNoContractionInOneExpression() 637 if (isArithmeticOperation(BN->getOp())) { in propagateNoContractionInOneExpression() 641 assert(isAssignOperation(UN->getOp())); in propagateNoContractionInOneExpression() [all …]
|
D | LiveTraverser.h | 76 if (candidate && candidate->getOp() == EOpFunction && candidate->getName() == name) { in pushFunction() 88 if (candidate && candidate->getOp() == EOpSequence && in pushGlobalReference() 110 if (node->getOp() == EOpFunctionCall) in visitAggregate()
|
/external/angle/third_party/vulkan-deps/glslang/src/glslang/MachineIndependent/ |
D | propagateNoContraction.cpp | 301 if (node->getOp() == glslang::EOpFunction) { in visitAggregate() 336 if (isAssignOperation(node->getOp())) { in visitUnary() 368 if (isAssignOperation(node->getOp())) { in visitBinary() 392 } else if (isDereferenceOperation(node->getOp())) { in visitBinary() 396 if (node->getOp() == glslang::EOpIndexDirectStruct) { in visitBinary() 490 assert(isAssignOperation(node->getOp())); in getPrecisenessAndRemainedAccessChain() 583 assert(isDereferenceOperation(node->getOp())); in visitBinary() 635 assert(isAssignOperation(BN->getOp())); in propagateNoContractionInOneExpression() 637 if (isArithmeticOperation(BN->getOp())) { in propagateNoContractionInOneExpression() 641 assert(isAssignOperation(UN->getOp())); in propagateNoContractionInOneExpression() [all …]
|
D | LiveTraverser.h | 76 if (candidate && candidate->getOp() == EOpFunction && candidate->getName() == name) { in pushFunction() 88 if (candidate && candidate->getOp() == EOpSequence && in pushGlobalReference() 110 if (node->getOp() == EOpFunctionCall) in visitAggregate()
|
/external/swiftshader/src/OpenGL/compiler/ |
D | ValidateLimitations.cpp | 125 switch (node->getOp()) { in visitBinary() 147 switch (node->getOp()) { in visitAggregate() 243 if (!decl || (decl->getOp() != EOpDeclaration)) { in validateForLoopInit() 254 if (!declInit || (declInit->getOp() != EOpInitialize)) { in validateForLoopInit() 311 switch (binOp->getOp()) { in validateForLoopCond() 322 getOperatorString(binOp->getOp())); in validateForLoopCond() 360 op = unOp->getOp(); in validateForLoopExpr() 363 op = binOp->getOp(); in validateForLoopExpr() 410 ASSERT(node->getOp() == EOpFunctionCall); in validateFunctionCall() 482 ASSERT((node->getOp() == EOpIndexDirect) || in validateIndexing() [all …]
|
D | intermOut.cpp | 101 switch (node->getOp()) { in visitBinary() 165 switch (node->getOp()) { in visitUnary() 249 if (node->getOp() == EOpNull) { in visitAggregate() 256 switch (node->getOp()) { in visitAggregate() 329 if (node->getOp() != EOpSequence && node->getOp() != EOpParameters) in visitAggregate()
|
/external/angle/src/compiler/translator/ |
D | ValidateLimitations.cpp | 127 switch (node->getOp()) in visitBinary() 234 if ((declInit == nullptr) || (declInit->getOp() != EOpInitialize)) in validateForLoopInit() 294 switch (binOp->getOp()) in validateForLoopCond() 305 GetOperatorString(binOp->getOp())); in validateForLoopCond() 345 op = unOp->getOp(); in validateForLoopExpr() 351 op = binOp->getOp(); in validateForLoopExpr() 424 ASSERT((node->getOp() == EOpIndexDirect) || (node->getOp() == EOpIndexIndirect)); in validateIndexing()
|
D | OutputTree.cpp | 119 switch (node->getOp()) in visitBinary() 272 if (node->getOp() == EOpIndexDirectStruct || node->getOp() == EOpIndexDirectInterfaceBlock) in visitBinary() 305 const TOperator op = node->getOp(); in visitUnary() 352 mOut << GetOperatorString(node->getOp()); in visitUnary() 405 const TOperator op = node->getOp(); in visitAggregate() 467 mOut << GetOperatorString(node->getOp()); in visitAggregate()
|
/external/angle/src/compiler/translator/tree_ops/ |
D | RewriteDfdy.cpp | 87 if ((node->getOp() != EOpDFdx) && (node->getOp() != EOpDFdy)) in visitAggregateWithRotation() 121 if (node->getOp() == EOpDFdx) in visitAggregateWithRotation() 140 if (node->getOp() == EOpDFdx) in visitAggregateWithRotation() 190 if (node->getOp() != EOpDFdy) in visitAggregateWithoutRotation()
|
/external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/AsmPrinter/ |
D | DwarfExpression.cpp | 230 if (Op && Op->getOp() != dwarf::DW_OP_LLVM_fragment) in addMachineRegExpression() 268 return Op.getOp() == dwarf::DW_OP_stack_value; in addMachineRegExpression() 283 if (Op && (Op->getOp() == dwarf::DW_OP_plus_uconst)) { in addMachineRegExpression() 295 if (Op && Op->getOp() == dwarf::DW_OP_constu) { in addMachineRegExpression() 299 if (N && N->getOp() == dwarf::DW_OP_plus && Offset <= IntMax) { in addMachineRegExpression() 302 } else if (N && N->getOp() == dwarf::DW_OP_minus && in addMachineRegExpression() 321 assert(Op && Op->getOp() == dwarf::DW_OP_LLVM_entry_value); in beginEntryValueExpression() 351 switch (Op->getOp()) { in isMemoryLocation() 367 if (SubRegisterSizeInBits && N && (N->getOp() != dwarf::DW_OP_LLVM_fragment)) in addExpression() 374 uint64_t OpNum = Op->getOp(); in addExpression()
|
/external/llvm-project/llvm/lib/CodeGen/AsmPrinter/ |
D | DwarfExpression.cpp | 262 if (Op && Op->getOp() != dwarf::DW_OP_LLVM_fragment) in addMachineRegExpression() 310 return Op.getOp() == dwarf::DW_OP_stack_value; in addMachineRegExpression() 325 if (Op && (Op->getOp() == dwarf::DW_OP_plus_uconst)) { in addMachineRegExpression() 337 if (Op && Op->getOp() == dwarf::DW_OP_constu) { in addMachineRegExpression() 341 if (N && N->getOp() == dwarf::DW_OP_plus && Offset <= IntMax) { in addMachineRegExpression() 344 } else if (N && N->getOp() == dwarf::DW_OP_minus && in addMachineRegExpression() 382 assert(Op && Op->getOp() == dwarf::DW_OP_LLVM_entry_value); in beginEntryValueExpression() 441 switch (Op->getOp()) { in isMemoryLocation() 461 if (SubRegisterSizeInBits && N && (N->getOp() != dwarf::DW_OP_LLVM_fragment)) in addExpression() 468 uint64_t OpNum = Op->getOp(); in addExpression()
|
/external/skqp/src/core/ |
D | SkClipStack.cpp | 706 if (kIntersect_SkClipOp != element->getOp() && kReplace_SkClipOp != element->getOp()) in internalQuickContains() 718 if (kReplace_SkClipOp == element->getOp()) { in internalQuickContains() 731 if (kIntersect_SkClipOp != element->getOp() && kReplace_SkClipOp != element->getOp()) in internalQuickContains() 743 if (kReplace_SkClipOp == element->getOp()) { in internalQuickContains() 764 SkClipOp elementOp = element->getOp(); in asPath() 786 if (prior->canBeIntersectedInPlace(fSaveCount, element.getOp())) { in pushElement() 818 } else if (kReplace_SkClipOp == element.getOp()) { in pushElement() 974 if (back->getOp() == kReplace_SkClipOp) { in isRRect() 980 if (back->getOp() == kIntersect_SkClipOp) { in isRRect() 989 if ((prior->getOp() != kIntersect_SkClipOp && in isRRect() [all …]
|
/external/angle/src/compiler/translator/tree_ops/vulkan/ |
D | RewriteR32fImages.cpp | 118 if (!BuiltInGroup::IsBuiltIn(node->getOp())) in RewriteBuiltinFunctionCall() 143 ASSERT(asBinary->getOp() == EOpIndexDirect || asBinary->getOp() == EOpIndexIndirect); in RewriteBuiltinFunctionCall() 165 switch (asBinary->getOp()) in RewriteBuiltinFunctionCall() 182 replacementExpression = new TIntermBinary(asBinary->getOp(), replacementExpression, index); in RewriteBuiltinFunctionCall()
|
/external/apache-xml/src/main/java/org/apache/xpath/axes/ |
D | WalkerFactory.java | 66 int stepType = compiler.getOp(stepOpCodePos); in loadOneWalker() 106 while (OpCodes.ENDOP != (stepType = compiler.getOp(stepOpCodePos))) in loadWalkers() 305 int stepType = compiler.getOp(stepOpCodePos); in getAxisFromStep() 403 int endFunc = opPos + compiler.getOp(opPos + 1) - 1; in functionProximateOrContainsProximate() 405 int funcID = compiler.getOp(opPos); in functionProximateOrContainsProximate() 420 int argOp = compiler.getOp(innerExprOpPos); in functionProximateOrContainsProximate() 432 int op = compiler.getOp(opPos); in isProximateInnerExpr() 495 while (OpCodes.OP_PREDICATE == compiler.getOp(predPos)) in mightBeProximate() 500 int predOp = compiler.getOp(innerExprOpPos); in mightBeProximate() 569 while (OpCodes.ENDOP != (stepType = compiler.getOp(stepOpCodePos))) in isOptimizableForDescendantIterator() [all …]
|
/external/skia/src/core/ |
D | SkClipStack.cpp | 749 if (kIntersect_SkClipOp != element->getOp() && kReplace_SkClipOp != element->getOp()) in internalQuickContains() 761 if (kReplace_SkClipOp == element->getOp()) { in internalQuickContains() 774 if (kIntersect_SkClipOp != element->getOp() && kReplace_SkClipOp != element->getOp()) in internalQuickContains() 786 if (kReplace_SkClipOp == element->getOp()) { in internalQuickContains() 800 if (prior->canBeIntersectedInPlace(fSaveCount, element.getOp())) { in pushElement() 841 } else if (kReplace_SkClipOp == element.getOp()) { in pushElement() 1010 if (back->getOp() == kReplace_SkClipOp) { in isRRect() 1016 if (back->getOp() == kIntersect_SkClipOp) { in isRRect() 1031 if ((prior->getOp() != kIntersect_SkClipOp && in isRRect() 1032 prior->getOp() != kReplace_SkClipOp) || in isRRect() [all …]
|
/external/angle/src/compiler/translator/tree_ops/gl/ |
D | VectorizeVectorScalarArithmetic.cpp | 91 switch (node->getOp()) in visitBinary() 151 TIntermBinary *newArg = new TIntermBinary(argBinary->getOp(), leftVectorized, rightVectorized); in replaceMathInsideConstructor() 185 TOperator compoundAssignmentOp = argBinary->getOp(); in replaceAssignInsideConstructor() 236 switch (argBinary->getOp()) in visitAggregate()
|