/external/llvm/examples/Kaleidoscope/Chapter2/ |
H A D | toy.cpp | 286 std::vector<std::string> ArgNames; 288 ArgNames.push_back(IdentifierStr); 295 return new PrototypeAST(FnName, ArgNames);
|
/external/llvm/examples/Kaleidoscope/Chapter3/ |
H A D | toy.cpp | 307 std::vector<std::string> ArgNames; 309 ArgNames.push_back(IdentifierStr); 316 return new PrototypeAST(FnName, ArgNames);
|
/external/llvm/examples/Kaleidoscope/Chapter4/ |
H A D | toy.cpp | 314 std::vector<std::string> ArgNames; 316 ArgNames.push_back(IdentifierStr); 323 return new PrototypeAST(FnName, ArgNames);
|
/external/llvm/examples/Kaleidoscope/Chapter6/ |
H A D | toy.cpp | 496 std::vector<std::string> ArgNames; 498 ArgNames.push_back(IdentifierStr); 506 if (Kind && ArgNames.size() != Kind) 509 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
|
/external/llvm/examples/Kaleidoscope/Chapter5/ |
H A D | toy.cpp | 415 std::vector<std::string> ArgNames; 417 ArgNames.push_back(IdentifierStr); 424 return new PrototypeAST(FnName, ArgNames);
|
/external/llvm/examples/Kaleidoscope/Chapter7/ |
H A D | toy.cpp | 561 std::vector<std::string> ArgNames; 563 ArgNames.push_back(IdentifierStr); 571 if (Kind && ArgNames.size() != Kind) 574 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
|
/external/llvm/examples/Kaleidoscope/MCJIT/cached/ |
H A D | toy-jit.cpp | 578 std::vector<std::string> ArgNames; 580 ArgNames.push_back(IdentifierStr); 588 if (Kind && ArgNames.size() != Kind) 591 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
|
H A D | toy.cpp | 584 std::vector<std::string> ArgNames; 586 ArgNames.push_back(IdentifierStr); 594 if (Kind && ArgNames.size() != Kind) 597 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
|
/external/llvm/examples/Kaleidoscope/MCJIT/initial/ |
H A D | toy.cpp | 561 std::vector<std::string> ArgNames; 563 ArgNames.push_back(IdentifierStr); 571 if (Kind && ArgNames.size() != Kind) 574 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
|
/external/llvm/examples/Kaleidoscope/MCJIT/lazy/ |
H A D | toy-jit.cpp | 563 std::vector<std::string> ArgNames; 565 ArgNames.push_back(IdentifierStr); 573 if (Kind && ArgNames.size() != Kind) 576 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
|
H A D | toy.cpp | 563 std::vector<std::string> ArgNames; 565 ArgNames.push_back(IdentifierStr); 573 if (Kind && ArgNames.size() != Kind) 576 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
|
/external/llvm/lib/TableGen/ |
H A D | Record.cpp | 902 std::vector<std::string> ArgNames; local 905 ArgNames.push_back(LHSs->getArgName(i)); 909 ArgNames.push_back(RHSs->getArgName(i)); 911 return DagInit::get(LHSs->getOperator(), "", Args, ArgNames); 1593 ProfileDagInit(ID, Val, ValName, Args, ArgNames); 1604 return DagInit::get(Op, ValName, NewArgs, ArgNames); 1616 if (!ArgNames[0].empty()) Result += ":$" + ArgNames[0]; 1619 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 | 1261 std::vector<std::string> ArgNames; member in class:llvm::VarBitInit::DagInit 1268 ArgNames(NameRange.begin(), NameRange.end()) {} 1300 assert(Num < ArgNames.size() && "Arg number out of range!"); 1301 return ArgNames[Num]; 1317 inline const_name_iterator name_begin() const { return ArgNames.begin(); } 1318 inline const_name_iterator name_end () const { return ArgNames.end(); } 1320 inline size_t name_size () const { return ArgNames.size(); } 1321 inline bool name_empty() const { return ArgNames.empty(); }
|
/external/llvm/examples/Kaleidoscope/MCJIT/complete/ |
H A D | toy.cpp | 608 std::vector<std::string> ArgNames; 610 ArgNames.push_back(IdentifierStr); 618 if (Kind && ArgNames.size() != Kind) 621 return new PrototypeAST(FnName, ArgNames, Kind != 0, BinaryPrecedence);
|