/external/llvm/examples/Kaleidoscope/Chapter2/ |
H A D | toy.cpp | 285 std::vector<std::string> ArgNames; 287 ArgNames.push_back(IdentifierStr); 294 return new PrototypeAST(FnName, ArgNames);
|
/external/llvm/examples/Kaleidoscope/Chapter3/ |
H A D | toy.cpp | 305 std::vector<std::string> ArgNames; 307 ArgNames.push_back(IdentifierStr); 314 return new PrototypeAST(FnName, ArgNames);
|
/external/llvm/examples/Kaleidoscope/Chapter4/ |
H A D | toy.cpp | 312 std::vector<std::string> ArgNames; 314 ArgNames.push_back(IdentifierStr); 321 return new PrototypeAST(FnName, ArgNames);
|
/external/llvm/examples/Kaleidoscope/Chapter6/ |
H A D | toy.cpp | 494 std::vector<std::string> ArgNames; 496 ArgNames.push_back(IdentifierStr); 504 if (Kind && ArgNames.size() != Kind) 507 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
|
/external/llvm/examples/Kaleidoscope/Chapter5/ |
H A D | toy.cpp | 413 std::vector<std::string> ArgNames; 415 ArgNames.push_back(IdentifierStr); 422 return new PrototypeAST(FnName, ArgNames);
|
/external/llvm/examples/Kaleidoscope/Chapter7/ |
H A D | toy.cpp | 559 std::vector<std::string> ArgNames; 561 ArgNames.push_back(IdentifierStr); 569 if (Kind && ArgNames.size() != Kind) 572 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
|
/external/llvm/examples/Kaleidoscope/MCJIT/cached/ |
H A D | toy-jit.cpp | 577 std::vector<std::string> ArgNames; 579 ArgNames.push_back(IdentifierStr); 587 if (Kind && ArgNames.size() != Kind) 590 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
|
H A D | toy.cpp | 583 std::vector<std::string> ArgNames; 585 ArgNames.push_back(IdentifierStr); 593 if (Kind && ArgNames.size() != Kind) 596 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
|
/external/llvm/examples/Kaleidoscope/MCJIT/initial/ |
H A D | toy.cpp | 560 std::vector<std::string> ArgNames; 562 ArgNames.push_back(IdentifierStr); 570 if (Kind && ArgNames.size() != Kind) 573 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
|
/external/llvm/examples/Kaleidoscope/MCJIT/lazy/ |
H A D | toy-jit.cpp | 562 std::vector<std::string> ArgNames; 564 ArgNames.push_back(IdentifierStr); 572 if (Kind && ArgNames.size() != Kind) 575 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
|
H A D | toy.cpp | 562 std::vector<std::string> ArgNames; 564 ArgNames.push_back(IdentifierStr); 572 if (Kind && ArgNames.size() != Kind) 575 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
|
/external/llvm/lib/TableGen/ |
H A D | Record.cpp | 898 std::vector<std::string> ArgNames; local 901 ArgNames.push_back(LHSs->getArgName(i)); 905 ArgNames.push_back(RHSs->getArgName(i)); 907 return DagInit::get(LHSs->getOperator(), "", Args, ArgNames); 1584 ProfileDagInit(ID, Val, ValName, Args, ArgNames); 1595 return DagInit::get(Op, ValName, NewArgs, ArgNames); 1607 if (!ArgNames[0].empty()) Result += ":$" + ArgNames[0]; 1610 if (!ArgNames[i].empty()) Result += ":$" + ArgNames[ [all...] |
/external/llvm/examples/ExceptionDemo/ |
H A D | ExceptionDemo.cpp | 194 typedef std::vector<std::string> ArgNames; typedef 216 const ArgNames &theArgNames, 1140 ArgNames argNames; 1403 ArgNames unwindArgNames; 1744 ArgNames argNames;
|
/external/llvm/include/llvm/TableGen/ |
H A D | Record.h | 1263 std::vector<std::string> ArgNames; member in class:llvm::VarBitInit::DagInit 1270 ArgNames(NameRange.begin(), NameRange.end()) {} 1302 assert(Num < ArgNames.size() && "Arg number out of range!"); 1303 return ArgNames[Num]; 1319 inline const_name_iterator name_begin() const { return ArgNames.begin(); } 1320 inline const_name_iterator name_end () const { return ArgNames.end(); } 1322 inline size_t name_size () const { return ArgNames.size(); } 1323 inline bool name_empty() const { return ArgNames.empty(); }
|
/external/llvm/examples/Kaleidoscope/MCJIT/complete/ |
H A D | toy.cpp | 607 std::vector<std::string> ArgNames; 609 ArgNames.push_back(IdentifierStr); 617 if (Kind && ArgNames.size() != Kind) 620 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
|