| /external/llvm/examples/Kaleidoscope/Chapter2/ |
| D | toy.cpp | 176 static std::map<char, int> BinopPrecedence; variable
184 int TokPrec = BinopPrecedence[CurTok]; in GetTokPrecedence()
438 BinopPrecedence['<'] = 10; in main()
439 BinopPrecedence['+'] = 20; in main()
440 BinopPrecedence['-'] = 20; in main()
441 BinopPrecedence['*'] = 40; // highest. in main()
|
| /external/llvm/examples/Kaleidoscope/Chapter3/ |
| D | toy.cpp | 178 static std::map<char, int> BinopPrecedence; variable
186 int TokPrec = BinopPrecedence[CurTok]; in GetTokPrecedence()
570 BinopPrecedence['<'] = 10; in main()
571 BinopPrecedence['+'] = 20; in main()
572 BinopPrecedence['-'] = 20; in main()
573 BinopPrecedence['*'] = 40; // highest. in main()
|
| /external/llvm/examples/Kaleidoscope/MCJIT/cached/ |
| D | toy-jit.cpp | 264 static std::map<char, int> BinopPrecedence; variable
272 int TokPrec = BinopPrecedence[CurTok]; in GetTokPrecedence()
994 BinopPrecedence[Proto->getOperatorName()] = Proto->getBinaryPrecedence(); in Codegen()
1020 BinopPrecedence.erase(Proto->getOperatorName()); in Codegen()
1147 BinopPrecedence['='] = 2; in main()
1148 BinopPrecedence['<'] = 10; in main()
1149 BinopPrecedence['+'] = 20; in main()
1150 BinopPrecedence['-'] = 20; in main()
1151 BinopPrecedence['/'] = 40; in main()
1152 BinopPrecedence['*'] = 40; // highest. in main()
|
| D | toy.cpp | 271 static std::map<char, int> BinopPrecedence; variable
279 int TokPrec = BinopPrecedence[CurTok]; in GetTokPrecedence()
1365 BinopPrecedence[Proto->getOperatorName()] = Proto->getBinaryPrecedence(); in Codegen()
1388 BinopPrecedence.erase(Proto->getOperatorName()); in Codegen()
1522 BinopPrecedence['='] = 2; in main()
1523 BinopPrecedence['<'] = 10; in main()
1524 BinopPrecedence['+'] = 20; in main()
1525 BinopPrecedence['-'] = 20; in main()
1526 BinopPrecedence['/'] = 40; in main()
1527 BinopPrecedence['*'] = 40; // highest. in main()
|
| /external/llvm/examples/Kaleidoscope/MCJIT/lazy/ |
| D | toy-jit.cpp | 249 static std::map<char, int> BinopPrecedence; variable
257 int TokPrec = BinopPrecedence[CurTok]; in GetTokPrecedence()
976 BinopPrecedence[Proto->getOperatorName()] = Proto->getBinaryPrecedence(); in Codegen()
1002 BinopPrecedence.erase(Proto->getOperatorName()); in Codegen()
1111 BinopPrecedence['='] = 2; in main()
1112 BinopPrecedence['<'] = 10; in main()
1113 BinopPrecedence['+'] = 20; in main()
1114 BinopPrecedence['-'] = 20; in main()
1115 BinopPrecedence['/'] = 40; in main()
1116 BinopPrecedence['*'] = 40; // highest. in main()
|
| D | toy.cpp | 250 static std::map<char, int> BinopPrecedence; variable
258 int TokPrec = BinopPrecedence[CurTok]; in GetTokPrecedence()
1263 BinopPrecedence[Proto->getOperatorName()] = Proto->getBinaryPrecedence(); in Codegen()
1286 BinopPrecedence.erase(Proto->getOperatorName()); in Codegen()
1397 BinopPrecedence['='] = 2; in main()
1398 BinopPrecedence['<'] = 10; in main()
1399 BinopPrecedence['+'] = 20; in main()
1400 BinopPrecedence['-'] = 20; in main()
1401 BinopPrecedence['/'] = 40; in main()
1402 BinopPrecedence['*'] = 40; // highest. in main()
|
| /external/llvm/examples/Kaleidoscope/Chapter4/ |
| D | toy.cpp | 184 static std::map<char, int> BinopPrecedence; variable
192 int TokPrec = BinopPrecedence[CurTok]; in GetTokPrecedence()
654 BinopPrecedence['<'] = 10; in main()
655 BinopPrecedence['+'] = 20; in main()
656 BinopPrecedence['-'] = 20; in main()
657 BinopPrecedence['*'] = 40; // highest. in main()
|
| /external/llvm/examples/Kaleidoscope/MCJIT/initial/ |
| D | toy.cpp | 248 static std::map<char, int> BinopPrecedence; variable
256 int TokPrec = BinopPrecedence[CurTok]; in GetTokPrecedence()
1223 BinopPrecedence[Proto->getOperatorName()] = Proto->getBinaryPrecedence(); in Codegen()
1246 BinopPrecedence.erase(Proto->getOperatorName()); in Codegen()
1356 BinopPrecedence['='] = 2; in main()
1357 BinopPrecedence['<'] = 10; in main()
1358 BinopPrecedence['+'] = 20; in main()
1359 BinopPrecedence['-'] = 20; in main()
1360 BinopPrecedence['/'] = 40; in main()
1361 BinopPrecedence['*'] = 40; // highest. in main()
|
| /external/llvm/examples/Kaleidoscope/Chapter6/ |
| D | toy.cpp | 259 static std::map<char, int> BinopPrecedence; variable
267 int TokPrec = BinopPrecedence[CurTok]; in GetTokPrecedence()
885 BinopPrecedence[P.getOperatorName()] = P.getBinaryPrecedence(); in codegen()
913 BinopPrecedence.erase(Proto->getOperatorName()); in codegen()
1046 BinopPrecedence['<'] = 10; in main()
1047 BinopPrecedence['+'] = 20; in main()
1048 BinopPrecedence['-'] = 20; in main()
1049 BinopPrecedence['*'] = 40; // highest. in main()
|
| /external/llvm/examples/Kaleidoscope/Chapter7/ |
| D | toy.cpp | 278 static std::map<char, int> BinopPrecedence; variable
286 int TokPrec = BinopPrecedence[CurTok]; in GetTokPrecedence()
1043 BinopPrecedence[P.getOperatorName()] = P.getBinaryPrecedence(); in codegen()
1079 BinopPrecedence.erase(Proto->getOperatorName()); in codegen()
1212 BinopPrecedence['='] = 2; in main()
1213 BinopPrecedence['<'] = 10; in main()
1214 BinopPrecedence['+'] = 20; in main()
1215 BinopPrecedence['-'] = 20; in main()
1216 BinopPrecedence['*'] = 40; // highest. in main()
|
| /external/llvm/examples/Kaleidoscope/Orc/initial/ |
| D | toy.cpp | 264 static std::map<char, int> BinopPrecedence; variable
272 int TokPrec = BinopPrecedence[CurTok]; in GetTokPrecedence()
1103 BinopPrecedence[Proto->getOperatorName()] = Proto->Precedence; in IRGen()
1126 BinopPrecedence.erase(Proto->getOperatorName()); in IRGen()
1316 BinopPrecedence['='] = 2; in main()
1317 BinopPrecedence['<'] = 10; in main()
1318 BinopPrecedence['+'] = 20; in main()
1319 BinopPrecedence['-'] = 20; in main()
1320 BinopPrecedence['/'] = 40; in main()
1321 BinopPrecedence['*'] = 40; // highest. in main()
|
| /external/llvm/examples/Kaleidoscope/MCJIT/complete/ |
| D | toy.cpp | 290 static std::map<char, int> BinopPrecedence; variable
298 int TokPrec = BinopPrecedence[CurTok]; in GetTokPrecedence()
1443 BinopPrecedence[Proto->getOperatorName()] = Proto->getBinaryPrecedence(); in Codegen()
1466 BinopPrecedence.erase(Proto->getOperatorName()); in Codegen()
1575 BinopPrecedence['='] = 2; in main()
1576 BinopPrecedence['<'] = 10; in main()
1577 BinopPrecedence['+'] = 20; in main()
1578 BinopPrecedence['-'] = 20; in main()
1579 BinopPrecedence['/'] = 40; in main()
1580 BinopPrecedence['*'] = 40; // highest. in main()
|
| /external/llvm/examples/Kaleidoscope/Orc/lazy_irgen/ |
| D | toy.cpp | 264 static std::map<char, int> BinopPrecedence; variable
272 int TokPrec = BinopPrecedence[CurTok]; in GetTokPrecedence()
1103 BinopPrecedence[Proto->getOperatorName()] = Proto->Precedence; in IRGen()
1126 BinopPrecedence.erase(Proto->getOperatorName()); in IRGen()
1351 BinopPrecedence['='] = 2; in main()
1352 BinopPrecedence['<'] = 10; in main()
1353 BinopPrecedence['+'] = 20; in main()
1354 BinopPrecedence['-'] = 20; in main()
1355 BinopPrecedence['/'] = 40; in main()
1356 BinopPrecedence['*'] = 40; // highest. in main()
|
| /external/llvm/examples/Kaleidoscope/Orc/lazy_codegen/ |
| D | toy.cpp | 264 static std::map<char, int> BinopPrecedence; variable
272 int TokPrec = BinopPrecedence[CurTok]; in GetTokPrecedence()
1103 BinopPrecedence[Proto->getOperatorName()] = Proto->Precedence; in IRGen()
1126 BinopPrecedence.erase(Proto->getOperatorName()); in IRGen()
1320 BinopPrecedence['='] = 2; in main()
1321 BinopPrecedence['<'] = 10; in main()
1322 BinopPrecedence['+'] = 20; in main()
1323 BinopPrecedence['-'] = 20; in main()
1324 BinopPrecedence['/'] = 40; in main()
1325 BinopPrecedence['*'] = 40; // highest. in main()
|
| /external/llvm/examples/Kaleidoscope/Chapter5/ |
| D | toy.cpp | 226 static std::map<char, int> BinopPrecedence; variable
234 int TokPrec = BinopPrecedence[CurTok]; in GetTokPrecedence()
928 BinopPrecedence['<'] = 10; in main()
929 BinopPrecedence['+'] = 20; in main()
930 BinopPrecedence['-'] = 20; in main()
931 BinopPrecedence['*'] = 40; // highest. in main()
|
| /external/llvm/examples/Kaleidoscope/Orc/fully_lazy/ |
| D | toy.cpp | 265 static std::map<char, int> BinopPrecedence; variable
273 int TokPrec = BinopPrecedence[CurTok]; in GetTokPrecedence()
1104 BinopPrecedence[Proto->getOperatorName()] = Proto->Precedence; in IRGen()
1127 BinopPrecedence.erase(Proto->getOperatorName()); in IRGen()
1421 BinopPrecedence['='] = 2; in main()
1422 BinopPrecedence['<'] = 10; in main()
1423 BinopPrecedence['+'] = 20; in main()
1424 BinopPrecedence['-'] = 20; in main()
1425 BinopPrecedence['/'] = 40; in main()
1426 BinopPrecedence['*'] = 40; // highest. in main()
|
| /external/llvm/examples/Kaleidoscope/Chapter8/ |
| D | toy.cpp | 415 static std::map<char, int> BinopPrecedence; variable
423 int TokPrec = BinopPrecedence[CurTok]; in GetTokPrecedence()
1238 BinopPrecedence[P.getOperatorName()] = P.getBinaryPrecedence(); in codegen()
1307 BinopPrecedence.erase(Proto->getOperatorName()); in codegen()
1409 BinopPrecedence['='] = 2; in main()
1410 BinopPrecedence['<'] = 10; in main()
1411 BinopPrecedence['+'] = 20; in main()
1412 BinopPrecedence['-'] = 20; in main()
1413 BinopPrecedence['*'] = 40; // highest. in main()
|
| /external/llvm/docs/tutorial/ |
| D | LangImpl2.rst | 362 /// BinopPrecedence - This holds the precedence for each binary operator that is
364 static std::map<char, int> BinopPrecedence;
372 int TokPrec = BinopPrecedence[CurTok];
380 BinopPrecedence['<'] = 10;
381 BinopPrecedence['+'] = 20;
382 BinopPrecedence['-'] = 20;
383 BinopPrecedence['*'] = 40; // highest.
|
| D | LangImpl7.rst | 564 BinopPrecedence['='] = 2;
565 BinopPrecedence['<'] = 10;
566 BinopPrecedence['+'] = 20;
567 BinopPrecedence['-'] = 20;
|
| D | LangImpl8.rst | 96 BinopPrecedence['*'] = 40; // highest.
|
| D | LangImpl6.rst | 288 BinopPrecedence[Proto->getOperatorName()] = Proto->getBinaryPrecedence();
|