| /external/deqp/framework/randomshaders/ |
| H A D | rsgBinaryOps.cpp | 34 template <int Precedence, Associativity Assoc>
35 BinaryOp<Precedence, Assoc>::BinaryOp (Token::Type operatorToken)
44 template <int Precedence, Associativity Assoc>
45 BinaryOp<Precedence, Assoc>::~BinaryOp (void)
51 template <int Precedence, Associativity Assoc>
52 Expression* BinaryOp<Precedence, Assoc>::createNextChild (GeneratorState& state)
54 int leftPrec = Assoc == ASSOCIATIVITY_LEFT ? Precedence : Precedence-1;
55 int rightPrec = Assoc == ASSOCIATIVITY_LEFT ? Precedence-1 : Precedence;
[all...] |
| H A D | rsgBinaryOps.hpp | 40 template <int Precedence, Associativity Assoc>
68 template <int Precedence, bool Float, bool Int, bool Bool, class ComputeValueRange, class EvaluateComp>
69 class BinaryVecOp : public BinaryOp<Precedence, ASSOCIATIVITY_LEFT>
|
| /external/clang/lib/Format/ |
| H A D | TokenAnnotator.cpp | 1010 void parse(int Precedence = 0) {
1019 if (!Current || Precedence > PrecedenceArrowAndPeriod)
1023 if (Precedence == prec::Conditional) {
1030 if (Precedence == PrecedenceUnaryOperator) {
1041 parse(Precedence + 1);
1046 Precedence == CurrentPrecedence) {
1048 addFakeParenthesis(Start, prec::Level(Precedence));
1055 (CurrentPrecedence != -1 && CurrentPrecedence < Precedence)) {
1058 if (Precedence == PrecedenceArrowAndPeriod) {
1062 addFakeParenthesis(Start, prec::Level(Precedence));
1108 addFakeParenthesis(FormatToken *Start, prec::Level Precedence) argument
[all...] |
| /external/llvm/examples/Kaleidoscope/Chapter6/ |
| H A D | toy.cpp | 185 unsigned Precedence; // Precedence if a binary op. member in class:__anon25454::PrototypeAST
189 : Name(name), Args(args), isOperator(isoperator), Precedence(prec) {}
199 unsigned getBinaryPrecedence() const { return Precedence; }
|
| /external/chromium_org/third_party/ply/ |
| H A D | yacc.py | 1341 self.Precedence = { } # Precedence rules for each terminal. Contains tuples of the
1344 self.UsedPrecedence = { } # Precedence rules that were actually used by the grammer.
1367 if term in self.Precedence:
1368 raise GrammarError("Precedence already specified for terminal '%s'" % term)
1371 self.Precedence[term] = (assoc,level)
1383 # Precedence is determined by the precedence of the right-most non-terminal
1422 prodprec = self.Precedence.get(precname,None)
1431 prodprec = self.Precedence.get(precname,('right',0))
1633 for termname in self.Precedence
[all...] |
| /external/chromium_org/v8/src/ |
| H A D | token.h | 283 static int Precedence(Value tok) {
|
| H A D | preparser.h | 430 static int Precedence(Token::Value token, bool accept_IN) { function in class:v8::internal::ParserBase
433 return Token::Precedence(token);
1868 // Precedence = 1
2134 // Precedence = 2
2252 // Precedence = 3
2275 // Precedence >= 4
2281 for (int prec1 = Precedence(peek(), accept_IN); prec1 >= prec; prec1--) {
2283 while (Precedence(peek(), accept_IN) == prec1) {
|
| /external/llvm/examples/Kaleidoscope/Chapter7/ |
| H A D | toy.cpp | 201 unsigned Precedence; // Precedence if a binary op. member in class:__anon25455::PrototypeAST
205 : Name(name), Args(args), isOperator(isoperator), Precedence(prec) {}
215 unsigned getBinaryPrecedence() const { return Precedence; }
|
| /external/llvm/examples/Kaleidoscope/MCJIT/cached/ |
| H A D | toy-jit.cpp | 219 unsigned Precedence; // Precedence if a binary op. member in class:PrototypeAST
223 : Name(name), Args(args), isOperator(isoperator), Precedence(prec) {}
233 unsigned getBinaryPrecedence() const { return Precedence; }
|
| H A D | toy.cpp | 225 unsigned Precedence; // Precedence if a binary op. member in class:PrototypeAST
229 : Name(name), Args(args), isOperator(isoperator), Precedence(prec) {}
239 unsigned getBinaryPrecedence() const { return Precedence; }
|
| /external/llvm/examples/Kaleidoscope/MCJIT/initial/ |
| H A D | toy.cpp | 202 unsigned Precedence; // Precedence if a binary op. member in class:PrototypeAST
206 : Name(name), Args(args), isOperator(isoperator), Precedence(prec) {}
216 unsigned getBinaryPrecedence() const { return Precedence; }
|
| /external/llvm/examples/Kaleidoscope/MCJIT/lazy/ |
| H A D | toy-jit.cpp | 204 unsigned Precedence; // Precedence if a binary op. member in class:PrototypeAST
208 : Name(name), Args(args), isOperator(isoperator), Precedence(prec) {}
218 unsigned getBinaryPrecedence() const { return Precedence; }
|
| H A D | toy.cpp | 204 unsigned Precedence; // Precedence if a binary op. member in class:PrototypeAST
208 : Name(name), Args(args), isOperator(isoperator), Precedence(prec) {}
218 unsigned getBinaryPrecedence() const { return Precedence; }
|
| /external/llvm/examples/Kaleidoscope/MCJIT/complete/ |
| H A D | toy.cpp | 249 unsigned Precedence; // Precedence if a binary op. member in class:PrototypeAST
253 : Name(name), Args(args), isOperator(isoperator), Precedence(prec) {}
263 unsigned getBinaryPrecedence() const { return Precedence; }
|
| /external/chromium_org/tools/gn/ |
| H A D | parser.cc | 21 enum Precedence { enum
|
| /external/llvm/lib/MC/MCParser/ |
| H A D | AsmParser.cpp | 329 bool parseBinOpRHS(unsigned Precedence, const MCExpr *&Res, SMLoc &EndLoc);
1084 // Lowest Precedence: &&, ||
1092 // Low Precedence: |, &, ^
1105 // Low Intermediate Precedence: ==, !=, <>, <, <=, >, >=
1126 // Intermediate Precedence: <<, >>
1134 // High Intermediate Precedence: +, -
1142 // Highest Precedence: *, /, %
1155 /// \brief Parse all binary operators with precedence >= 'Precedence'.
1157 bool AsmParser::parseBinOpRHS(unsigned Precedence, const MCExpr *&Res, argument
1165 if (TokPrec < Precedence)
[all...] |