HomeSort by relevance Sort by last modified time
    Searched defs:Indices (Results 1 - 17 of 17) sorted by null

  /external/llvm/lib/Object/
Archive.cpp 212 // Skip SymbolCount to get to the indices table.
213 const char *Indices = Buf + sizeof(support::ulittle32_t);
218 *(reinterpret_cast<const support::ulittle16_t*>(Indices)
261 buf += 4 + (symbol_count * 2); // Skip indices.
  /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 645 ArrayRef<unsigned> Indices = CE->getIndices();
646 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/IR/
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     [all...]
Constants.cpp     [all...]
  /external/llvm/lib/Transforms/IPO/
ArgumentPromotion.cpp 73 /// A vector used to hold the indices of a single GEP instruction
253 /// Checks if Indices, or a prefix of Indices, is in Set.
254 static bool PrefixIn(const ArgPromotion::IndicesVector &Indices,
257 Low = Set.upper_bound(Indices);
260 // Low is now the last element smaller than or equal to Indices. This means
261 // it points to a prefix of Indices (possibly Indices itself), if such
265 return Low != Set.end() && IsPrefix(*Low, Indices);
268 /// Mark the given indices (ToMark) as safe in the given set of indice
    [all...]
  /external/clang/lib/CodeGen/
CGBuiltin.cpp     [all...]
CGExprConstant.cpp 97 llvm::Value *Indices[] = {
102 llvm::ConstantExpr::getInBoundsGetElementPtr(VTable, Indices);
    [all...]
CGExpr.cpp 617 llvm::Value *Indices[] = { Builder.getInt32(0), Slot };
619 Builder.CreateLoad(Builder.CreateInBoundsGEP(Cache, Indices));
    [all...]
  /external/llvm/include/llvm/IR/
Instructions.h 704 assert(Ty && "Invalid GetElementPtrInst indices for type!");
716 /// list of indices. The first ctor can optionally insert before an existing
780 /// Null is returned if the indices are invalid for the specified
837 /// hasAllZeroIndices - Return true if all of the indices of this GEP are
842 /// hasAllConstantIndices - Return true if all of the indices of this GEP are
    [all...]
  /external/llvm/lib/Transforms/InstCombine/
InstructionCombining.cpp 759 /// or not there is a sequence of GEP indices into the type that will land us at
820 // If this GEP has only 0 indices, it is the same pointer as
822 // the indices.
    [all...]
  /external/llvm/utils/TableGen/
CodeGenRegisters.cpp 87 // The lane mask is simply the union of all sub-indices.
251 // Expand any composed subreg indices.
253 // qsub_1 subreg, add a dsub_2 subreg. Keep growing Indices and process
254 // expanded subreg indices recursively.
255 SmallVector<CodeGenSubRegIndex*, 8> Indices = ExplicitSubRegIndices;
256 for (unsigned i = 0; i != Indices.size(); ++i) {
257 CodeGenSubRegIndex *Idx = Indices[i];
275 Indices.push_back(I->second);
281 // Work backwards in the Indices vector in order to compose subregs bottom-up.
295 while (!Indices.empty() && !Orphans.empty())
    [all...]
  /external/llvm/lib/Transforms/Vectorize/
LoopVectorize.cpp 574 /// 64 bit loop indices.
783 SmallVector<Constant*, 8> Indices;
788 Indices.push_back(ConstantInt::get(ITy, StartIdx + Idx));
791 // Add the consecutive indices to the vector value.
792 Constant *Cv = ConstantVector::get(Indices);
822 // the indices are constant then we know it is consecutive. We can
    [all...]
  /external/clang/lib/Serialization/
ASTReader.cpp     [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
DAGCombiner.cpp     [all...]

Completed in 520 milliseconds