| /external/llvm/examples/Kaleidoscope/Chapter2/ |
| toy.cpp | 154 int TokPrec = BinopPrecedence[CurTok];
155 if (TokPrec <= 0) return -1;
156 return TokPrec;
236 int TokPrec = GetTokPrecedence();
240 if (TokPrec < ExprPrec)
254 if (TokPrec < NextPrec) {
255 RHS = ParseBinOpRHS(TokPrec+1, RHS);
|
| /external/llvm/examples/Kaleidoscope/Chapter3/ |
| toy.cpp | 174 int TokPrec = BinopPrecedence[CurTok];
175 if (TokPrec <= 0) return -1;
176 return TokPrec;
257 int TokPrec = GetTokPrecedence();
261 if (TokPrec < ExprPrec)
275 if (TokPrec < NextPrec) {
276 RHS = ParseBinOpRHS(TokPrec+1, RHS);
|
| /external/llvm/examples/Kaleidoscope/Chapter4/ |
| toy.cpp | 181 int TokPrec = BinopPrecedence[CurTok];
182 if (TokPrec <= 0) return -1;
183 return TokPrec;
264 int TokPrec = GetTokPrecedence();
268 if (TokPrec < ExprPrec)
282 if (TokPrec < NextPrec) {
283 RHS = ParseBinOpRHS(TokPrec+1, RHS);
|
| /external/llvm/examples/Kaleidoscope/Chapter5/ |
| toy.cpp | 210 int TokPrec = BinopPrecedence[CurTok];
211 if (TokPrec <= 0) return -1;
212 return TokPrec;
365 int TokPrec = GetTokPrecedence();
369 if (TokPrec < ExprPrec)
383 if (TokPrec < NextPrec) {
384 RHS = ParseBinOpRHS(TokPrec+1, RHS);
|
| /external/llvm/examples/Kaleidoscope/Chapter6/ |
| toy.cpp | 238 int TokPrec = BinopPrecedence[CurTok];
239 if (TokPrec <= 0) return -1;
240 return TokPrec;
409 int TokPrec = GetTokPrecedence();
413 if (TokPrec < ExprPrec)
427 if (TokPrec < NextPrec) {
428 RHS = ParseBinOpRHS(TokPrec+1, RHS);
|
| /external/llvm/examples/Kaleidoscope/Chapter7/ |
| toy.cpp | 256 int TokPrec = BinopPrecedence[CurTok];
257 if (TokPrec <= 0) return -1;
258 return TokPrec;
474 int TokPrec = GetTokPrecedence();
478 if (TokPrec < ExprPrec)
492 if (TokPrec < NextPrec) {
493 RHS = ParseBinOpRHS(TokPrec+1, RHS);
[all...] |
| /external/llvm/examples/Kaleidoscope/MCJIT/cached/ |
| toy-jit.cpp | 273 int TokPrec = BinopPrecedence[CurTok];
274 if (TokPrec <= 0) return -1;
275 return TokPrec;
491 int TokPrec = GetTokPrecedence();
495 if (TokPrec < ExprPrec)
509 if (TokPrec < NextPrec) {
510 RHS = ParseBinOpRHS(TokPrec+1, RHS);
[all...] |
| toy.cpp | 279 int TokPrec = BinopPrecedence[CurTok];
280 if (TokPrec <= 0) return -1;
281 return TokPrec;
497 int TokPrec = GetTokPrecedence();
501 if (TokPrec < ExprPrec)
515 if (TokPrec < NextPrec) {
516 RHS = ParseBinOpRHS(TokPrec+1, RHS);
[all...] |
| /external/llvm/examples/Kaleidoscope/MCJIT/initial/ |
| toy.cpp | 256 int TokPrec = BinopPrecedence[CurTok];
257 if (TokPrec <= 0) return -1;
258 return TokPrec;
474 int TokPrec = GetTokPrecedence();
478 if (TokPrec < ExprPrec)
492 if (TokPrec < NextPrec) {
493 RHS = ParseBinOpRHS(TokPrec+1, RHS);
[all...] |
| /external/llvm/examples/Kaleidoscope/MCJIT/lazy/ |
| toy-jit.cpp | 258 int TokPrec = BinopPrecedence[CurTok];
259 if (TokPrec <= 0) return -1;
260 return TokPrec;
476 int TokPrec = GetTokPrecedence();
480 if (TokPrec < ExprPrec)
494 if (TokPrec < NextPrec) {
495 RHS = ParseBinOpRHS(TokPrec+1, RHS);
[all...] |
| toy.cpp | 258 int TokPrec = BinopPrecedence[CurTok];
259 if (TokPrec <= 0) return -1;
260 return TokPrec;
476 int TokPrec = GetTokPrecedence();
480 if (TokPrec < ExprPrec)
494 if (TokPrec < NextPrec) {
495 RHS = ParseBinOpRHS(TokPrec+1, RHS);
[all...] |
| /external/llvm/examples/Kaleidoscope/MCJIT/complete/ |
| toy.cpp | 303 int TokPrec = BinopPrecedence[CurTok];
304 if (TokPrec <= 0) return -1;
305 return TokPrec;
521 int TokPrec = GetTokPrecedence();
525 if (TokPrec < ExprPrec)
539 if (TokPrec < NextPrec) {
540 RHS = ParseBinOpRHS(TokPrec+1, RHS);
[all...] |
| /external/llvm/lib/MC/MCParser/ |
| AsmParser.cpp | [all...] |
