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

1 2

  /frameworks/compile/libbcc/lib/Renderscript/
RSX86TranslateGEPPass.cpp 65 // The difference is that this function handles non-constant array indices and
110 llvm::Value *Indices[1] = {computeGEPOffset(GEP)};
114 llvm::Type::getInt8Ty(*Context), Int8Ptr, llvm::makeArrayRef(Indices),
  /external/llvm/lib/Target/XCore/
XCoreLowerThreadLocal.cpp 213 SmallVector<Value *, 2> Indices;
214 Indices.push_back(Constant::getNullValue(Type::getInt64Ty(Ctx)));
215 Indices.push_back(ThreadID);
217 Builder.CreateInBoundsGEP(NewGV->getValueType(), NewGV, Indices);
  /external/llvm/lib/Transforms/Scalar/
CorrelatedValuePropagation.cpp 310 SmallVector<unsigned, 4> Indices;
320 Indices.push_back(ArgNo + 1);
326 if (Indices.empty())
331 AS = AS.addAttribute(Ctx, Indices, Attribute::get(Ctx, Attribute::NonNull));
Scalarizer.cpp 221 // for all uncached indices.
455 SmallVector<Value *, 8> Indices;
456 Indices.resize(NumIndices);
458 Indices[J] = Ops[J][I];
459 Res[I] = Builder.CreateGEP(GEPI.getSourceElementType(), Base[I], Indices,
SCCP.cpp     [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;
  /frameworks/base/libs/hwui/
Glop.h 98 struct Indices {
100 const void* indices; member in struct:android::uirenderer::Glop::Mesh::Indices
101 } indices; member in struct:android::uirenderer::Glop::Mesh
  /external/llvm/lib/Analysis/
Lint.cpp 673 ArrayRef<unsigned> Indices = CE->getIndices();
674 if (Value *W = FindInsertedValue(CE->getOperand(0), Indices))
  /external/llvm/lib/CodeGen/
MIRPrinter.cpp 70 /// Maps from stack object indices to operand indices which will be used when
720 auto Indices = TII->getSerializableTargetIndices();
721 for (const auto &I : Indices) {
ShadowStackGCLowering.cpp 354 Value *Indices[] = {ConstantInt::get(Type::getInt32Ty(Context), 0),
357 Value *Val = B.CreateGEP(Ty, BasePtr, Indices, Name);
367 Value *Indices[] = {ConstantInt::get(Type::getInt32Ty(Context), 0),
369 Value *Val = B.CreateGEP(Ty, BasePtr, Indices, Name);
  /external/llvm/lib/IR/
ConstantsContext.h 173 Indices(IdxList.begin(), IdxList.end()) {
177 /// Indices - These identify which value to extract.
178 const SmallVector<unsigned, 4> Indices;
205 Indices(IdxList.begin(), IdxList.end()) {
210 /// Indices - These identify the position for the insertion.
211 const SmallVector<unsigned, 4> Indices;
Constants.cpp     [all...]
AsmWriter.cpp     [all...]
  /external/llvm/lib/Object/
Archive.cpp 472 // Skip SymbolCount to get to the indices table.
473 const char *Indices = Buf + 4;
477 uint16_t OffsetIndex = read16le(Indices + SymbolIndex * 2);
568 buf += 4 + (symbol_count * 2); // Skip indices.
  /external/llvm/lib/Target/AMDGPU/
AMDGPUPromoteAlloca.cpp 349 std::vector<Value*> Indices;
350 Indices.push_back(Constant::getNullValue(Type::getInt32Ty(Mod->getContext())));
351 Indices.push_back(TID);
353 Value *Offset = Builder.CreateGEP(GVTy, GV, Indices);
  /external/llvm/lib/Transforms/Utils/
LowerSwitch.cpp 187 SmallVector<unsigned, 8> Indices;
190 Indices.push_back(Idx);
195 for (auto III = Indices.rbegin(), IIE = Indices.rend(); III != IIE; ++III)
  /external/llvm/lib/Transforms/IPO/
ArgumentPromotion.cpp 81 /// A vector used to hold the indices of a single GEP instruction
375 /// Checks if Indices, or a prefix of Indices, is in Set.
376 static bool PrefixIn(const ArgPromotion::IndicesVector &Indices,
379 Low = Set.upper_bound(Indices);
382 // Low is now the last element smaller than or equal to Indices. This means
383 // it points to a prefix of Indices (possibly Indices itself), if such
387 return Low != Set.end() && IsPrefix(*Low, Indices);
390 /// Mark the given indices (ToMark) as safe in the given set of indice
    [all...]
  /external/llvm/lib/Transforms/InstCombine/
InstCombineLoadStoreAlloca.cpp 81 // If the GEP has all zero indices, it doesn't offset the pointer. If it
553 Value *Indices[2] = {
557 auto *Ptr = IC.Builder->CreateInBoundsGEP(ST, Addr, makeArrayRef(Indices), EltName);
663 // also search through non-zero constant indices if we kept track of the
664 // offsets those indices implied.
670 // Find the first non-zero index of a GEP. If all indices are zero, return
686 // Skip through initial 'zero' indices, and find the corresponding pointer
704 // If there are more indices after the one we might replace with a zero, make
721 // FIXME: If the GEP is not inbounds, and there are extra indices after the
724 // better, ignoring zero indices (and other indices we can prove smal
    [all...]
InstCombineCalls.cpp 429 // Convert bit indices to byte indices.
509 // Convert bit indices to byte indices.
    [all...]
  /external/llvm/lib/Target/AArch64/
AArch64InstrInfo.cpp     [all...]
  /external/lzma/CPP/7zip/Archive/7z/
7zUpdate.cpp 398 CRecordVector<UInt32> Indices;
909 groups[GetGroupIndex(method.PasswordIsDefined, filteredGroup)].Indices.Add(i);
    [all...]
  /external/llvm/lib/CodeGen/MIRParser/
MIParser.cpp 64 /// Maps from indices to unnamed global values and metadata nodes.
72 /// Maps from subregister names to subregister indices.
78 /// Maps from target index names to target indices.
910 // indices must be less than tied max.
    [all...]
  /external/llvm/lib/Target/Mips/
MipsSEISelLowering.cpp     [all...]
  /external/llvm/utils/TableGen/
CodeGenRegisters.cpp 93 // The lane mask is simply the union of all sub-indices.
252 // Expand any composed subreg indices.
254 // qsub_1 subreg, add a dsub_2 subreg. Keep growing Indices and process
255 // expanded subreg indices recursively.
256 SmallVector<CodeGenSubRegIndex*, 8> Indices = ExplicitSubRegIndices;
257 for (unsigned i = 0; i != Indices.size(); ++i) {
258 CodeGenSubRegIndex *Idx = Indices[i];
276 Indices.push_back(I->second);
282 // Work backwards in the Indices vector in order to compose subregs bottom-up.
296 while (!Indices.empty() && !Orphans.empty())
    [all...]
  /external/llvm/include/llvm/IR/
Instructions.h 831 assert(Ty && "Invalid GetElementPtrInst indices for type!");
848 /// list of indices. The first ctor can optionally insert before an existing
2234 inline iterator_range<idx_iterator> indices() const { function in class:llvm::ExtractValueInst
2351 inline iterator_range<idx_iterator> indices() const { function in class:llvm::InsertValueInst
    [all...]

Completed in 685 milliseconds

1 2