HomeSort by relevance Sort by last modified time
    Searched refs:Indices (Results 1 - 25 of 39) sorted by null

1 2

  /external/llvm/include/llvm/CodeGen/
Analysis.h 34 /// of insertvalue or extractvalue indices that identify a member, return
38 const unsigned *Indices,
43 ArrayRef<unsigned> Indices,
45 return ComputeLinearIndex(Ty, Indices.begin(), Indices.end(), CurIndex);
LiveIntervalAnalysis.h 150 /// Indices. The points in the Indices array must be jointly dominated by
153 /// If a SlotIndex in Indices is the end index of a basic block, LI will be
157 void extendToIndices(LiveInterval *LI, ArrayRef<SlotIndex> Indices);
310 /// getRegMaskSlots - Returns a sorted array of slot indices of all
314 /// getRegMaskSlotsInBlock - Returns a sorted array of slot indices of all
  /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/CodeGen/
Analysis.cpp 30 /// of insertvalue or extractvalue indices that identify a member, return
34 const unsigned *Indices,
38 if (Indices && Indices == IndicesEnd)
47 if (Indices && *Indices == unsigned(EI - EB))
48 return ComputeLinearIndex(*EI, Indices+1, IndicesEnd, CurIndex);
57 if (Indices && *Indices == i)
58 return ComputeLinearIndex(EltTy, Indices+1, IndicesEnd, CurIndex)
    [all...]
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);
LiveIntervalAnalysis.cpp 435 ArrayRef<SlotIndex> Indices) {
438 for (unsigned i = 0, e = Indices.size(); i != e; ++i)
439 LRCalc->extend(LI, Indices[i]);
    [all...]
  /external/llvm/include/llvm/Analysis/
ConstantFolding.h 70 /// instruction with the specified operands and indices. The constant result is
86 /// indices (with an *implied* zero pointer index that is not in the list),
90 ArrayRef<Constant*> Indices);
  /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/llvm/lib/Transforms/Instrumentation/
ProfilingUtils.cpp 118 std::vector<Constant*> Indices(2);
119 Indices[0] = Constant::getNullValue(Type::getInt32Ty(Context));
120 Indices[1] = ConstantInt::get(Type::getInt32Ty(Context), CounterNum);
122 ConstantExpr::getGetElementPtr(CounterArray, Indices);
  /external/llvm/lib/Transforms/Scalar/
SROA.cpp     [all...]
ScalarReplAggregates.cpp 504 // If this is a GEP with a variable indices, we can't handle it.
510 SmallVector<Value*, 8> Indices(GEP->op_begin()+1, GEP->op_end());
517 GEPNonConstantIdx = Indices.pop_back_val();
524 Indices);
610 SmallVector<Value*, 8> Indices(GEP->op_begin()+1, GEP->op_end());
615 GEPNonConstantIdx = Indices.pop_back_val();
619 Indices);
    [all...]
  /external/llvm/lib/IR/
DataLayout.cpp 666 ArrayRef<Value *> Indices) const {
672 TI = gep_type_begin(ptrTy, Indices);
673 for (unsigned CurIDX = 0, EndIDX = Indices.size(); CurIDX != EndIDX;
676 assert(Indices[CurIDX]->getType() ==
679 unsigned FieldNo = cast<ConstantInt>(Indices[CurIDX])->getZExtValue();
694 if (int64_t arrayIdx = cast<ConstantInt>(Indices[CurIDX])->getSExtValue())
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...]
  /external/llvm/bindings/ocaml/llvm/
llvm_ocaml.c 709 CAMLprim LLVMValueRef llvm_const_gep(LLVMValueRef ConstantVal, value Indices) {
710 return LLVMConstGEP(ConstantVal, (LLVMValueRef*) Op_val(Indices),
711 Wosize_val(Indices));
716 value Indices) {
717 return LLVMConstInBoundsGEP(ConstantVal, (LLVMValueRef*) Op_val(Indices),
718 Wosize_val(Indices));
723 value Indices) {
724 CAMLparam1(Indices);
725 int size = Wosize_val(Indices);
731 idxs[i] = Int_val(Field(Indices, i))
    [all...]
  /external/clang/lib/CodeGen/
CGBuiltin.cpp     [all...]
CGExpr.cpp 617 llvm::Value *Indices[] = { Builder.getInt32(0), Slot };
619 Builder.CreateLoad(Builder.CreateInBoundsGEP(Cache, Indices));
    [all...]
  /external/llvm/lib/AsmParser/
LLParser.h 211 bool ParseIndexList(SmallVectorImpl<unsigned> &Indices,bool &AteExtraComma);
212 bool ParseIndexList(SmallVectorImpl<unsigned> &Indices) {
214 if (ParseIndexList(Indices, AteExtraComma)) return true;
LLParser.cpp     [all...]
  /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/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/include/llvm/IR/
DataLayout.h 354 /// the specified indices. This is used to implement getelementptr.
355 uint64_t getIndexedOffset(Type *Ty, ArrayRef<Value *> Indices) const;
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/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/clang/lib/AST/
DeclCXX.cpp     [all...]
  /external/llvm/lib/Analysis/
Lint.cpp 645 ArrayRef<unsigned> Indices = CE->getIndices();
646 if (Value *W = FindInsertedValue(CE->getOperand(0), Indices))

Completed in 1104 milliseconds

1 2