/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/ |
H A D | DeltaAlgorithm.cpp | 45 const changesetlist_ty &Sets) { 47 UpdatedSearchState(Changes, Sets); 50 if (Sets.size() <= 1) 55 if (Search(Changes, Sets, Res)) 60 for (changesetlist_ty::const_iterator it = Sets.begin(), 61 ie = Sets.end(); it != ie; ++it) 63 if (SplitSets.size() == Sets.size()) 70 const changesetlist_ty &Sets, 73 for (changesetlist_ty::const_iterator it = Sets.begin(), 74 ie = Sets 44 Delta(const changeset_ty &Changes, const changesetlist_ty &Sets) argument 69 Search(const changeset_ty &Changes, const changesetlist_ty &Sets, changeset_ty &Res) argument 77 changesetlist_ty Sets; local [all...] |
H A D | DAGDeltaAlgorithm.cpp | 118 const changesetlist_ty &Sets, 120 DDA.UpdatedSearchState(Changes, Sets, Required); 163 const changesetlist_ty &Sets) override { 164 DDAI.UpdatedSearchState(Changes, Sets, Required); 117 UpdatedSearchState(const changeset_ty &Changes, const changesetlist_ty &Sets, const changeset_ty &Required) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | DeltaAlgorithm.h | 60 const changesetlist_ty &Sets); 62 /// Search - Search for a subset (or subsets) in \p Sets which can be 68 bool Search(const changeset_ty &Changes, const changesetlist_ty &Sets, 74 const changesetlist_ty &Sets) {} 73 UpdatedSearchState(const changeset_ty &Changes, const changesetlist_ty &Sets) argument
|
H A D | DAGDeltaAlgorithm.h | 69 const changesetlist_ty &Sets, 68 UpdatedSearchState(const changeset_ty &Changes, const changesetlist_ty &Sets, const changeset_ty &Required) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/ |
H A D | DWARFDebugPubTable.h | 63 std::vector<Set> Sets; member in class:llvm::DWARFDebugPubTable 75 ArrayRef<Set> getData() { return Sets; }
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/ |
H A D | DWARFDebugPubTable.cpp | 28 Sets.push_back({}); 29 Set &SetData = Sets.back(); 49 for (const Set &S : Sets) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | CFLSteensAliasAnalysis.cpp | 73 StratifiedSets<InstantiatedValue> Sets; member in class:CFLSteensAAResult::FunctionInfo 81 return Sets; 119 : Sets(std::move(S)) { 148 auto &Link = Sets.getLink(SetIndex); 167 auto RetInfo = Sets.find(InstantiatedValue{RetVal, 0}); 176 auto ParamInfo = Sets.find(InstantiatedValue{&Param, 0}); 298 auto &Sets = MaybeInfo->getStratifiedSets(); local 299 auto MaybeA = Sets.find(InstantiatedValue{ValA, 0}); 303 auto MaybeB = Sets.find(InstantiatedValue{ValB, 0}); 309 auto AttrsA = Sets [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | TableGen.cpp | 208 SetTheory Sets; local 209 Sets.addFieldExpander("Set", "Elements"); 212 const std::vector<Record*> *Elts = Sets.expand(Rec);
|
H A D | CodeGenRegisters.h | 523 SetTheory Sets; member in class:llvm::CodeGenRegBank 615 SetTheory &getSets() { return Sets; }
|
H A D | CodeGenSchedule.cpp | 171 Sets.addFieldExpander("InstRW", "Instrs"); 175 Sets.addOperator("instrs", std::make_unique<InstrsOp>()); 176 Sets.addOperator("instregex", std::make_unique<InstRegexOp>(Target)); 1050 const RecVec *InstDefs = Sets.expand(InstRWDef); 1071 const RecVec *OrigInstDefs = Sets.expand(RWDefs[0]); 1274 const RecVec *InstDefs = Sets.expand(Rec);
|
H A D | CodeGenSchedule.h | 416 SetTheory Sets; member in class:llvm::CodeGenSchedModels
|
H A D | CodeGenRegisters.cpp | 1097 // Configure register Sets to understand register classes and tuples. 1098 Sets.addFieldExpander("RegisterClass", "MemberList"); 1099 Sets.addFieldExpander("CalleeSavedRegs", "SaveList"); 1100 Sets.addExpander("RegisterTuples", 1125 std::vector<Record *> TupRegs = *Sets.expand(R);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | SplitModule.cpp | 171 SmallVector<SortType, 64> Sets; 179 Sets.push_back( 183 llvm::sort(Sets, [](const SortType &a, const SortType &b) { 190 for (auto &I : Sets) {
|
/freebsd-11-stable/share/mk/ |
H A D | bsd.clang-analyze.mk | 19 # CLANG_ANALYZE_OUTPUT_DIR Sets which directory output set by
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/ |
H A D | AttributeImpl.h | 256 AttributeListImpl(LLVMContext &C, ArrayRef<AttributeSet> Sets);
|
H A D | Attributes.cpp | 904 ArrayRef<AttributeSet> Sets) 905 : Context(C), NumAttrSets(Sets.size()) { 906 assert(!Sets.empty() && "pointless AttributeListImpl"); 909 llvm::copy(Sets, getTrailingObjects<AttributeSet>()); 917 for (const auto &I : Sets[0]) { 930 ArrayRef<AttributeSet> Sets) { 931 for (const auto &Set : Sets) 903 AttributeListImpl(LLVMContext &C, ArrayRef<AttributeSet> Sets) argument 929 Profile(FoldingSetNodeID &ID, ArrayRef<AttributeSet> Sets) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | LowerTypeTests.cpp | 2074 std::vector<std::pair<GlobalClassesTy::iterator, unsigned>> Sets; 2090 Sets.emplace_back(I, MaxUniqueId); 2092 llvm::sort(Sets, 2099 for (const auto &S : Sets) {
|