HomeSort by: relevance | last modified time | path
    Searched refs:TokPrec (Results 1 - 20 of 20) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter2/
toy.cpp 179 int TokPrec = BinopPrecedence[CurTok];
180 if (TokPrec <= 0)
182 return TokPrec;
276 int TokPrec = GetTokPrecedence();
280 if (TokPrec < ExprPrec)
295 if (TokPrec < NextPrec) {
296 RHS = ParseBinOpRHS(TokPrec + 1, std::move(RHS));
  /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter3/
toy.cpp 205 int TokPrec = BinopPrecedence[CurTok];
206 if (TokPrec <= 0)
208 return TokPrec;
303 int TokPrec = GetTokPrecedence();
307 if (TokPrec < ExprPrec)
322 if (TokPrec < NextPrec) {
323 RHS = ParseBinOpRHS(TokPrec + 1, std::move(RHS));
  /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter4/
toy.cpp 215 int TokPrec = BinopPrecedence[CurTok];
216 if (TokPrec <= 0)
218 return TokPrec;
313 int TokPrec = GetTokPrecedence();
317 if (TokPrec < ExprPrec)
332 if (TokPrec < NextPrec) {
333 RHS = ParseBinOpRHS(TokPrec + 1, std::move(RHS));
  /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter1/
toy.cpp 311 int TokPrec = BinopPrecedence[CurTok];
312 if (TokPrec <= 0)
314 return TokPrec;
558 int TokPrec = GetTokPrecedence();
562 if (TokPrec < ExprPrec)
577 if (TokPrec < NextPrec) {
578 RHS = ParseBinOpRHS(TokPrec + 1, std::move(RHS));
  /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter2/
toy.cpp 311 int TokPrec = BinopPrecedence[CurTok];
312 if (TokPrec <= 0)
314 return TokPrec;
558 int TokPrec = GetTokPrecedence();
562 if (TokPrec < ExprPrec)
577 if (TokPrec < NextPrec) {
578 RHS = ParseBinOpRHS(TokPrec + 1, std::move(RHS));
  /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter3/
toy.cpp 311 int TokPrec = BinopPrecedence[CurTok];
312 if (TokPrec <= 0)
314 return TokPrec;
558 int TokPrec = GetTokPrecedence();
562 if (TokPrec < ExprPrec)
577 if (TokPrec < NextPrec) {
578 RHS = ParseBinOpRHS(TokPrec + 1, std::move(RHS));
  /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter4/
toy.cpp 294 int TokPrec = BinopPrecedence[CurTok];
295 if (TokPrec <= 0)
297 return TokPrec;
541 int TokPrec = GetTokPrecedence();
545 if (TokPrec < ExprPrec)
560 if (TokPrec < NextPrec) {
561 RHS = ParseBinOpRHS(TokPrec + 1, std::move(RHS));
  /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter5/
toy.cpp 260 int TokPrec = BinopPrecedence[CurTok];
261 if (TokPrec <= 0)
263 return TokPrec;
440 int TokPrec = GetTokPrecedence();
444 if (TokPrec < ExprPrec)
459 if (TokPrec < NextPrec) {
460 RHS = ParseBinOpRHS(TokPrec + 1, std::move(RHS));
  /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter6/
toy.cpp 294 int TokPrec = BinopPrecedence[CurTok];
295 if (TokPrec <= 0)
297 return TokPrec;
490 int TokPrec = GetTokPrecedence();
494 if (TokPrec < ExprPrec)
509 if (TokPrec < NextPrec) {
510 RHS = ParseBinOpRHS(TokPrec + 1, std::move(RHS));
  /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter7/
toy.cpp 316 int TokPrec = BinopPrecedence[CurTok];
317 if (TokPrec <= 0)
319 return TokPrec;
563 int TokPrec = GetTokPrecedence();
567 if (TokPrec < ExprPrec)
582 if (TokPrec < NextPrec) {
583 RHS = ParseBinOpRHS(TokPrec + 1, std::move(RHS));
  /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter8/
toy.cpp 317 int TokPrec = BinopPrecedence[CurTok];
318 if (TokPrec <= 0)
320 return TokPrec;
564 int TokPrec = GetTokPrecedence();
568 if (TokPrec < ExprPrec)
583 if (TokPrec < NextPrec) {
584 RHS = ParseBinOpRHS(TokPrec + 1, std::move(RHS));
  /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/MCJIT/cached/
toy-jit.cpp 272 int TokPrec = BinopPrecedence[CurTok];
273 if (TokPrec <= 0) return -1;
274 return TokPrec;
490 int TokPrec = GetTokPrecedence();
494 if (TokPrec < ExprPrec)
508 if (TokPrec < NextPrec) {
509 RHS = ParseBinOpRHS(TokPrec+1, RHS);
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);
  /src/external/apache2/llvm/dist/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);
  /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/MCJIT/lazy/
toy-jit.cpp 257 int TokPrec = BinopPrecedence[CurTok];
258 if (TokPrec <= 0) return -1;
259 return TokPrec;
475 int TokPrec = GetTokPrecedence();
479 if (TokPrec < ExprPrec)
493 if (TokPrec < NextPrec) {
494 RHS = ParseBinOpRHS(TokPrec+1, RHS);
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);
  /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/Chapter9/
toy.cpp 424 int TokPrec = BinopPrecedence[CurTok];
425 if (TokPrec <= 0)
427 return TokPrec;
675 int TokPrec = GetTokPrecedence();
679 if (TokPrec < ExprPrec)
695 if (TokPrec < NextPrec) {
696 RHS = ParseBinOpRHS(TokPrec + 1, std::move(RHS));
  /src/external/apache2/llvm/dist/llvm/examples/Kaleidoscope/MCJIT/complete/
toy.cpp 298 int TokPrec = BinopPrecedence[CurTok];
299 if (TokPrec <= 0) return -1;
300 return TokPrec;
516 int TokPrec = GetTokPrecedence();
520 if (TokPrec < ExprPrec)
534 if (TokPrec < NextPrec) {
535 RHS = ParseBinOpRHS(TokPrec+1, RHS);
  /src/external/apache2/llvm/dist/llvm/lib/MC/MCParser/
AsmParser.cpp 1733 unsigned TokPrec = getBinOpPrecedence(Lexer.getKind(), Kind);
1737 if (TokPrec < Precedence)
1751 if (TokPrec < NextTokPrec && parseBinOpRHS(TokPrec + 1, RHS, EndLoc))
MasmParser.cpp 1938 unsigned TokPrec = getBinOpPrecedence(TokKind, Kind);
1942 if (TokPrec < Precedence)
1956 if (TokPrec < NextTokPrec && parseBinOpRHS(TokPrec + 1, RHS, EndLoc))

Completed in 44 milliseconds