| /external/turbine/java/com/google/turbine/tree/ |
| D | TurbineOperatorKind.java | 24 POST_INCR("++", Precedence.POSTFIX),
25 POST_DECR("--", Precedence.POSTFIX),
26 PRE_INCR("++", Precedence.UNARY),
27 PRE_DECR("--", Precedence.UNARY),
28 UNARY_PLUS("+", Precedence.UNARY),
29 NEG("-", Precedence.UNARY),
30 BITWISE_COMP("~", Precedence.UNARY),
31 NOT("!", Precedence.UNARY),
32 MULT("*", Precedence.MULTIPLICATIVE),
33 DIVIDE("/", Precedence.MULTIPLICATIVE),
[all …]
|
| /external/google-java-format/core/src/test/resources/com/google/googlejavaformat/java/testdata/ |
| D | B27078833.input | 3 POST_INCR(Precedence.POSTFIX),
4 POST_DECR(Precedence.POSTFIX),
6 PRE_INCR(Precedence.UNARY),
7 PRE_DECR(Precedence.UNARY),
8 PLUS(Precedence.UNARY),
9 NEG(Precedence.UNARY),
10 COMP(Precedence.UNARY),
11 NOT(Precedence.UNARY),
13 MULT(Precedence.MULTIPLICATIVE),
14 DIVIDE(Precedence.MULTIPLICATIVE),
[all …]
|
| D | B27078833.output | 2 POST_INCR(Precedence.POSTFIX),
3 POST_DECR(Precedence.POSTFIX),
5 PRE_INCR(Precedence.UNARY),
6 PRE_DECR(Precedence.UNARY),
7 PLUS(Precedence.UNARY),
8 NEG(Precedence.UNARY),
9 COMP(Precedence.UNARY),
10 NOT(Precedence.UNARY),
12 MULT(Precedence.MULTIPLICATIVE),
13 DIVIDE(Precedence.MULTIPLICATIVE),
[all …]
|
| /external/skia/src/sksl/codegen/ |
| D | SkSLPipelineStageCodeGenerator.cpp | 55 using Precedence = Operator::Precedence; typedef in SkSL::PipelineStage::PipelineStageCodeGenerator
76 void writeExpression(const Expression& expr, Precedence parentPrecedence);
78 void writeAnyConstructor(const AnyConstructor& c, Precedence parentPrecedence);
81 void writeBinaryExpression(const BinaryExpression& b, Precedence parentPrecedence);
82 void writeTernaryExpression(const TernaryExpression& t, Precedence parentPrecedence);
84 void writePrefixExpression(const PrefixExpression& p, Precedence parentPrecedence);
85 void writePostfixExpression(const PostfixExpression& p, Precedence parentPrecedence);
175 this->writeExpression(*arguments.back(), Precedence::kSequence); in writeFunctionCall()
204 this->writeExpression(*arg, Precedence::kSequence); in writeFunctionCall()
234 this->writeExpression(*stmt.test(), Precedence::kTopLevel); in writeIfStatement()
[all …]
|
| D | SkSLGLSLCodeGenerator.cpp | 185 void GLSLCodeGenerator::writeExpression(const Expression& expr, Precedence parentPrecedence) { in writeExpression()
262 this->writeExpression(absExpr, Precedence::kTopLevel); in writeMinAbsHack()
264 this->writeExpression(otherExpr, Precedence::kAssignment); in writeMinAbsHack()
270 this->writeExpression(x, Precedence::kTopLevel); in writeInverseSqrtHack()
336 this->writeExpression(mat, Precedence::kTopLevel); in writeDeterminantHack()
424 this->writeExpression(mat, Precedence::kTopLevel); in writeInverseHack()
452 this->writeExpression(mat, Precedence::kTopLevel); in writeTransposeHack()
490 this->writeExpression(*arguments[0], Precedence::kSequence); in writeFunctionCall()
492 this->writeExpression(*p.operand(), Precedence::kMultiplicative); in writeFunctionCall()
524 this->writeExpression(*arguments[0], Precedence::kSequence); in writeFunctionCall()
[all …]
|
| D | SkSLGLSLCodeGenerator.h | 64 using Precedence = Operator::Precedence;
122 void writeExpression(const Expression& expr, Precedence parentPrecedence);
138 virtual void writeAnyConstructor(const AnyConstructor& c, Precedence parentPrecedence);
140 virtual void writeCastConstructor(const AnyConstructor& c, Precedence parentPrecedence);
146 virtual void writeBinaryExpression(const BinaryExpression& b, Precedence parentPrecedence);
149 Precedence parentPrecedence);
151 virtual void writeTernaryExpression(const TernaryExpression& t, Precedence parentPrecedence);
155 void writePrefixExpression(const PrefixExpression& p, Precedence parentPrecedence);
157 void writePostfixExpression(const PostfixExpression& p, Precedence parentPrecedence);
|
| D | SkSLMetalCodeGenerator.h | 71 using Precedence = Operator::Precedence;
160 void writeExpression(const Expression& expr, Precedence parentPrecedence);
201 void writeConstructorCompound(const ConstructorCompound& c, Precedence parentPrecedence);
203 void writeConstructorCompoundMatrix(const ConstructorCompound& c, Precedence parentPrecedence);
206 Precedence parentPrecedence);
211 Precedence parentPrecedence);
216 Precedence parentPrecedence);
222 void writeBinaryExpression(const BinaryExpression& b, Precedence parentPrecedence);
224 void writeTernaryExpression(const TernaryExpression& t, Precedence parentPrecedence);
228 void writePrefixExpression(const PrefixExpression& p, Precedence parentPrecedence);
[all …]
|
| D | SkSLMetalCodeGenerator.cpp | 131 void MetalCodeGenerator::writeExpression(const Expression& expr, Precedence parentPrecedence) { in writeExpression()
273 this->writeExpression(*arguments[index], Precedence::kAssignment); in getOutParamHelper()
307 this->writeExpression(*arguments[index], Precedence::kAssignment); in getOutParamHelper()
381 this->writeExpression(*outVars[i], Precedence::kSequence); in writeFunctionCall()
383 this->writeExpression(*arguments[i], Precedence::kSequence); in writeFunctionCall()
513 this->writeExpression(*arg, Precedence::kSequence); in writeArgumentList()
522 this->writeExpression(*arguments[0], Precedence::kSequence); in writeIntrinsicCall()
524 this->writeExpression(*arguments[0], Precedence::kSequence); in writeIntrinsicCall()
532 this->writeExpression(*arguments[1], Precedence::kSequence); in writeIntrinsicCall()
536 this->writeExpression(*arguments[1], Precedence::kSequence); in writeIntrinsicCall()
[all …]
|
| D | SkSLDSLCPPCodeGenerator.h | 28 using Precedence = Operator::Precedence;
30 void writeAnyConstructor(const AnyConstructor& c, Precedence parentPrecedence) override;
34 void writeCastConstructor(const AnyConstructor& c, Precedence parentPrecedence) override;
52 void writeTernaryExpression(const TernaryExpression& t, Precedence parentPrecedence) override;
|
| D | SkSLDSLCPPCodeGenerator.cpp | 233 this->writeExpression(*swizzle.base(), Precedence::kPostfix); in writeSwizzle()
243 this->writeExpression(*swizzle.base(), Precedence::kPostfix); in writeSwizzle()
252 this->writeExpression(*swizzle.base(), Precedence::kSequence); in writeSwizzle()
267 Precedence parentPrecedence) { in writeTernaryExpression()
272 this->writeExpression(*t.test(), Precedence::kSequence); in writeTernaryExpression()
274 this->writeExpression(*t.ifTrue(), Precedence::kSequence); in writeTernaryExpression()
276 this->writeExpression(*t.ifFalse(), Precedence::kSequence); in writeTernaryExpression()
343 this->writeExpression(*arguments[index], Precedence::kSequence); in writeFunctionCall()
413 this->writeExpression(*argument, Precedence::kSequence); in writeFunctionCall()
499 this->writeExpression(*r.expression(), Precedence::kTopLevel); in writeReturnStatement()
[all …]
|
| D | SkSLCPPCodeGenerator.h | 28 using Precedence = Operator::Precedence;
42 void writeBinaryExpression(const BinaryExpression& b, Precedence parentPrecedence) override;
|
| /external/llvm-project/flang/lib/Evaluate/ |
| D | formatting.cpp | 149 enum class Precedence { // in increasing order for sane comparisons enum
164 template <typename A> constexpr Precedence ToPrecedence(const A &) { in ToPrecedence()
165 return Precedence::Top; in ToPrecedence()
168 static Precedence ToPrecedence(const LogicalOperation<KIND> &x) { in ToPrecedence()
172 return Precedence::And; in ToPrecedence()
174 return Precedence::Or; in ToPrecedence()
176 return Precedence::Not; in ToPrecedence()
179 return Precedence::Equivalence; in ToPrecedence()
182 template <int KIND> constexpr Precedence ToPrecedence(const Not<KIND> &) { in ToPrecedence()
183 return Precedence::Not; in ToPrecedence()
[all …]
|
| /external/llvm-project/compiler-rt/lib/scudo/ |
| D | scudo_tsd.h | 34 atomic_store_relaxed(&Precedence, 0); in ALIGNED()
37 if (atomic_load_relaxed(&Precedence) == 0) in ALIGNED()
38 atomic_store_relaxed(&Precedence, static_cast<uptr>( in ALIGNED()
44 atomic_store_relaxed(&Precedence, 0); in ALIGNED()
50 inline uptr getPrecedence() { return atomic_load_relaxed(&Precedence); } in ALIGNED()
54 atomic_uintptr_t Precedence; in ALIGNED() local
|
| D | scudo_tsd_shared.cpp | 84 const uptr Precedence = TSDs[Index].getPrecedence(); in getTSDAndLockSlow() local
86 if (Precedence && Precedence < LowestPrecedence) { in getTSDAndLockSlow()
88 LowestPrecedence = Precedence; in getTSDAndLockSlow()
|
| /external/scudo/standalone/ |
| D | tsd.h | 44 atomic_store_relaxed(&Precedence, 0); in tryLock()
47 if (atomic_load_relaxed(&Precedence) == 0) in tryLock()
49 &Precedence, in tryLock()
54 atomic_store_relaxed(&Precedence, 0); in lock()
58 inline uptr getPrecedence() { return atomic_load_relaxed(&Precedence); } in getPrecedence()
62 atomic_uptr Precedence = {}; member
|
| D | tsd_shared.h | 179 const uptr Precedence = TSDs[Index].getPrecedence(); in getTSDAndLockSlow() local
181 if (Precedence && Precedence < LowestPrecedence) { in getTSDAndLockSlow()
183 LowestPrecedence = Precedence; in getTSDAndLockSlow()
|
| /external/llvm-project/compiler-rt/lib/scudo/standalone/ |
| D | tsd.h | 44 atomic_store_relaxed(&Precedence, 0); in tryLock()
47 if (atomic_load_relaxed(&Precedence) == 0) in tryLock()
49 &Precedence, in tryLock()
54 atomic_store_relaxed(&Precedence, 0); in lock()
58 inline uptr getPrecedence() { return atomic_load_relaxed(&Precedence); } in getPrecedence()
62 atomic_uptr Precedence; member
|
| D | tsd_shared.h | 179 const uptr Precedence = TSDs[Index].getPrecedence(); in getTSDAndLockSlow() local
181 if (Precedence && Precedence < LowestPrecedence) { in getTSDAndLockSlow()
183 LowestPrecedence = Precedence; in getTSDAndLockSlow()
|
| /external/skqp/src/sksl/ |
| D | SkSLGLSLCodeGenerator.h | 55 enum Precedence { enum
136 void writeExpression(const Expression& expr, Precedence parentPrecedence);
152 void writeConstructor(const Constructor& c, Precedence parentPrecedence);
158 static Precedence GetBinaryPrecedence(Token::Kind op);
160 virtual void writeBinaryExpression(const BinaryExpression& b, Precedence parentPrecedence);
162 Precedence parentPrecedence);
164 void writeTernaryExpression(const TernaryExpression& t, Precedence parentPrecedence);
168 void writePrefixExpression(const PrefixExpression& p, Precedence parentPrecedence);
170 void writePostfixExpression(const PostfixExpression& p, Precedence parentPrecedence);
|
| D | SkSLMetalCodeGenerator.h | 59 enum Precedence { enum
177 void writeExpression(const Expression& expr, Precedence parentPrecedence);
193 void writeConstructor(const Constructor& c, Precedence parentPrecedence);
199 static Precedence GetBinaryPrecedence(Token::Kind op);
201 void writeBinaryExpression(const BinaryExpression& b, Precedence parentPrecedence);
203 void writeTernaryExpression(const TernaryExpression& t, Precedence parentPrecedence);
207 void writePrefixExpression(const PrefixExpression& p, Precedence parentPrecedence);
209 void writePostfixExpression(const PostfixExpression& p, Precedence parentPrecedence);
|
| /external/skia/src/sksl/ |
| D | SkSLOperators.cpp | 16 Operator::Precedence Operator::getBinaryPrecedence() const { in getBinaryPrecedence()
20 case Kind::TK_PERCENT: return Precedence::kMultiplicative; in getBinaryPrecedence()
22 case Kind::TK_MINUS: return Precedence::kAdditive; in getBinaryPrecedence()
24 case Kind::TK_SHR: return Precedence::kShift; in getBinaryPrecedence()
28 case Kind::TK_GTEQ: return Precedence::kRelational; in getBinaryPrecedence()
30 case Kind::TK_NEQ: return Precedence::kEquality; in getBinaryPrecedence()
31 case Kind::TK_BITWISEAND: return Precedence::kBitwiseAnd; in getBinaryPrecedence()
32 case Kind::TK_BITWISEXOR: return Precedence::kBitwiseXor; in getBinaryPrecedence()
33 case Kind::TK_BITWISEOR: return Precedence::kBitwiseOr; in getBinaryPrecedence()
34 case Kind::TK_LOGICALAND: return Precedence::kLogicalAnd; in getBinaryPrecedence()
[all …]
|
| /external/deqp/framework/randomshaders/ |
| D | rsgBinaryOps.cpp | 196 template <int Precedence, Associativity Assoc>
197 BinaryOp<Precedence, Assoc>::BinaryOp (Token::Type operatorToken) in BinaryOp()
206 template <int Precedence, Associativity Assoc>
207 BinaryOp<Precedence, Assoc>::~BinaryOp (void) in ~BinaryOp()
213 template <int Precedence, Associativity Assoc>
214 Expression* BinaryOp<Precedence, Assoc>::createNextChild (GeneratorState& state) in createNextChild()
216 int leftPrec = Assoc == ASSOCIATIVITY_LEFT ? Precedence : Precedence-1; in createNextChild()
217 int rightPrec = Assoc == ASSOCIATIVITY_LEFT ? Precedence-1 : Precedence; in createNextChild()
325 template <int Precedence, Associativity Assoc>
326 float BinaryOp<Precedence, Assoc>::getWeight (const GeneratorState& state, ConstValueRangeAccess va… in getWeight()
[all …]
|
| /external/python/cpython2/Lib/email/test/data/ |
| D | msg_02.txt | 54 Precedence: bulk
68 Precedence: bulk
83 Precedence: bulk
98 Precedence: bulk
113 Precedence: bulk
|
| /external/python/cpython3/Lib/test/test_email/data/ |
| D | msg_02.txt | 54 Precedence: bulk
68 Precedence: bulk
83 Precedence: bulk
98 Precedence: bulk
113 Precedence: bulk
|
| /external/rust/crates/syn/src/ |
| D | expr.rs | 1087 enum Precedence { enum
1103 impl Precedence { impl
1106 BinOp::Add(_) | BinOp::Sub(_) => Precedence::Arithmetic, in of()
1107 BinOp::Mul(_) | BinOp::Div(_) | BinOp::Rem(_) => Precedence::Term, in of()
1108 BinOp::And(_) => Precedence::And, in of()
1109 BinOp::Or(_) => Precedence::Or, in of()
1110 BinOp::BitXor(_) => Precedence::BitXor, in of()
1111 BinOp::BitAnd(_) => Precedence::BitAnd, in of()
1112 BinOp::BitOr(_) => Precedence::BitOr, in of()
1113 BinOp::Shl(_) | BinOp::Shr(_) => Precedence::Shift, in of()
[all …]
|