Searched refs:TypeVec (Results 1 – 6 of 6) sorted by relevance
| /external/swiftshader/third_party/LLVM/utils/TableGen/ |
| D | CodeGenDAGPatterns.cpp | 52 TypeVec.push_back(VT); in TypeSet()
59 TypeVec.append(VTList.begin(), VTList.end()); in TypeSet()
66 array_pod_sort(TypeVec.begin(), TypeVec.end()); in TypeSet()
67 assert(std::unique(TypeVec.begin(), TypeVec.end()) == TypeVec.end()); in TypeSet()
81 TypeVec.push_back(LegalTypes[i]); in FillWithPossibleTypes()
84 if (TypeVec.empty()) in FillWithPossibleTypes()
88 if (TypeVec.size() == 1) return true; in FillWithPossibleTypes()
91 array_pod_sort(TypeVec.begin(), TypeVec.end()); in FillWithPossibleTypes()
92 TypeVec.erase(std::unique(TypeVec.begin(), TypeVec.end()), TypeVec.end()); in FillWithPossibleTypes()
100 for (unsigned i = 0, e = TypeVec.size(); i != e; ++i) in hasIntegerTypes()
[all …]
|
| D | CodeGenDAGPatterns.h | 57 SmallVector<MVT::SimpleValueType, 4> TypeVec; variable
63 bool isCompletelyUnknown() const { return TypeVec.empty(); } in isCompletelyUnknown()
66 if (TypeVec.size() != 1) return false; in isConcrete()
67 unsigned char T = TypeVec[0]; (void)T; in isConcrete()
74 return (MVT::SimpleValueType)TypeVec[0]; in getConcrete()
82 assert(!TypeVec.empty() && "Not a type list!"); in getTypeList()
83 return TypeVec; in getTypeList()
87 return TypeVec.size() == 1 && TypeVec[0] == MVT::isVoid; in isVoid()
138 bool operator!=(const TypeSet &RHS) const { return TypeVec != RHS.TypeVec; }
139 bool operator==(const TypeSet &RHS) const { return TypeVec == RHS.TypeVec; }
|
| /external/llvm/utils/TableGen/ |
| D | CodeGenDAGPatterns.cpp | 58 TypeVec.push_back(VT); in TypeSet()
65 TypeVec.append(VTList.begin(), VTList.end()); in TypeSet()
72 array_pod_sort(TypeVec.begin(), TypeVec.end()); in TypeSet()
73 assert(std::unique(TypeVec.begin(), TypeVec.end()) == TypeVec.end()); in TypeSet()
90 TypeVec.push_back(VT); in FillWithPossibleTypes()
93 if (TypeVec.empty()) { in FillWithPossibleTypes()
99 if (TypeVec.size() == 1) return true; in FillWithPossibleTypes()
102 array_pod_sort(TypeVec.begin(), TypeVec.end()); in FillWithPossibleTypes()
103 TypeVec.erase(std::unique(TypeVec.begin(), TypeVec.end()), TypeVec.end()); in FillWithPossibleTypes()
111 return std::any_of(TypeVec.begin(), TypeVec.end(), isInteger); in hasIntegerTypes()
[all …]
|
| D | CodeGenDAGPatterns.h | 58 SmallVector<MVT::SimpleValueType, 4> TypeVec; variable
64 bool isCompletelyUnknown() const { return TypeVec.empty(); } in isCompletelyUnknown()
67 if (TypeVec.size() != 1) return false; in isConcrete()
68 unsigned char T = TypeVec[0]; (void)T; in isConcrete()
75 return (MVT::SimpleValueType)TypeVec[0]; in getConcrete()
83 assert(!TypeVec.empty() && "Not a type list!"); in getTypeList()
84 return TypeVec; in getTypeList()
88 return TypeVec.size() == 1 && TypeVec[0] == MVT::isVoid; in isVoid()
154 bool operator!=(const TypeSet &RHS) const { return TypeVec != RHS.TypeVec; }
155 bool operator==(const TypeSet &RHS) const { return TypeVec == RHS.TypeVec; }
|
| /external/spirv-llvm/lib/SPIRV/libSPIRV/ |
| D | SPIRVModule.cpp | 338 SPIRVTypeVec TypeVec; member in SPIRV::SPIRVModuleImpl
503 TypeVec.push_back(static_cast<SPIRVType*>(E)); in layoutEntry()
782 for (auto *T : TypeVec) { in createForwardPointers()
1191 SPIRVTypeVec TypeVec; member in SPIRV::TopologicalSort
1231 TypeVec.push_back(static_cast<SPIRVType*>(E)); in visit()
1262 << S.TypeVec in operator <<()
1329 << TopologicalSort(MI.TypeVec, MI.ConstVec, MI.VariableVec, in operator <<()
1463 std::vector<SPIRVType *> TypeVec; in getValueTypes() local
1465 TypeVec.push_back(getValue(i)->getType()); in getValueTypes()
1466 return TypeVec; in getValueTypes()
|
| D | SPIRVEntry.cpp | 217 std::vector<SPIRVType *> TypeVec; in getValueTypes() local
219 TypeVec.push_back(getValue(i)->getType()); in getValueTypes()
220 return TypeVec; in getValueTypes()
|