| /external/clang/test/CXX/temp/temp.decls/temp.variadic/ |
| metafunctions.cpp | 149 namespace Indices {
153 template<unsigned I, unsigned N, int ...Indices>
154 struct build_indices_impl<I, N, int_tuple<Indices...> >
155 : build_indices_impl<I+1, N, int_tuple<Indices..., I> > {
158 template<unsigned N, int ...Indices>
159 struct build_indices_impl<N, N, int_tuple<Indices...> > {
160 typedef int_tuple<Indices...> type;
|
| /external/llvm/lib/Analysis/ |
| Lint.cpp | 611 ArrayRef<unsigned> Indices = CE->getIndices();
612 if (Value *W = FindInsertedValue(CE->getOperand(0), Indices))
|
| /external/llvm/lib/CodeGen/ |
| ShadowStackGC.cpp | 351 Value *Indices[] = { ConstantInt::get(Type::getInt32Ty(Context), 0),
354 Value* Val = B.CreateGEP(BasePtr, Indices, Name);
364 Value *Indices[] = { ConstantInt::get(Type::getInt32Ty(Context), 0),
366 Value *Val = B.CreateGEP(BasePtr, Indices, Name);
|
| /external/llvm/lib/Transforms/IPO/ |
| ArgumentPromotion.cpp | 73 /// A vector used to hold the indices of a single GEP instruction
252 /// Checks if Indices, or a prefix of Indices, is in Set.
253 static bool PrefixIn(const ArgPromotion::IndicesVector &Indices,
256 Low = Set.upper_bound(Indices);
259 // Low is now the last element smaller than or equal to Indices. This means
260 // it points to a prefix of Indices (possibly Indices itself), if such
264 return Low != Set.end() && IsPrefix(*Low, Indices);
267 /// Mark the given indices (ToMark) as safe in the given set of indice
[all...] |
| /external/llvm/lib/VMCore/ |
| ConstantsContext.h | 173 Indices(IdxList) {
177 /// Indices - These identify which value to extract.
178 const SmallVector<unsigned, 4> Indices;
199 Indices(IdxList) {
204 /// Indices - These identify the position for the insertion.
205 const SmallVector<unsigned, 4> Indices;
323 operands(ops.begin(), ops.end()), indices(inds.begin(), inds.end()) {}
328 SmallVector<unsigned, 4> indices; member in struct:llvm::ExprMapKeyType
334 this->indices == that.indices;
[all...] |
| AsmWriter.cpp | 966 ArrayRef<unsigned> Indices = CE->getIndices();
967 for (unsigned i = 0, e = Indices.size(); i != e; ++i)
968 Out << ", " << Indices[i];
[all...] |
| Constants.cpp | [all...] |
| /external/clang/lib/CodeGen/ |
| CGBuiltin.cpp | [all...] |
| CGExprConstant.cpp | 97 llvm::Value *Indices[] = {
102 llvm::ConstantExpr::getInBoundsGetElementPtr(VTable, Indices);
[all...] |
| CGExpr.cpp | [all...] |
| /external/llvm/include/llvm/ |
| Instructions.h | 705 assert(Ty && "Invalid GetElementPtrInst indices for type!");
717 /// list of indices. The first ctor can optionally insert before an existing
774 /// Null is returned if the indices are invalid for the specified
834 /// hasAllZeroIndices - Return true if all of the indices of this GEP are
839 /// hasAllConstantIndices - Return true if all of the indices of this GEP are
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstructionCombining.cpp | 738 /// or not there is a sequence of GEP indices into the type that will land us at
799 // If this GEP has only 0 indices, it is the same pointer as
801 // the indices.
816 // Eliminate unneeded casts for indices, and replace indices which displace
825 // Skip indices into struct types.
850 // Combine Indices - If the source pointer to this getelementptr instruction
851 // is a getelementptr instruction, combine the indices of the two
[all...] |
| /external/llvm/utils/TableGen/ |
| CodeGenRegisters.cpp | 243 // Expand any composed subreg indices.
245 // qsub_1 subreg, add a dsub_2 subreg. Keep growing Indices and process
246 // expanded subreg indices recursively.
247 SmallVector<CodeGenSubRegIndex*, 8> Indices = ExplicitSubRegIndices;
248 for (unsigned i = 0; i != Indices.size(); ++i) {
249 CodeGenSubRegIndex *Idx = Indices[i];
267 Indices.push_back(I->second);
273 // Work backwards in the Indices vector in order to compose subregs bottom-up.
287 while (!Indices.empty() && !Orphans.empty()) {
288 CodeGenSubRegIndex *Idx = Indices.pop_back_val()
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| DAGCombiner.cpp | [all...] |
