Searched refs:Idx (Results 1 - 25 of 560) sorted by relevance

1234567891011>>

/external/compiler-rt/test/asan/TestCases/Linux/
H A Dscariness_score_test.cc50 void HeapBuferOverflow(int Idx, ReadOrWrite w) { argument
54 t[100 + Idx] = T();
56 sink = t[100 + Idx];
61 void HeapUseAfterFree(int Idx, ReadOrWrite w) { argument
67 t[Idx] = T();
69 sink = t[Idx];
73 void StackBufferOverflow(int Idx, ReadOrWrite w) { argument
76 sink = t[Idx];
78 t[100 + Idx] = T();
80 sink = t[100 + Idx];
92 StackUseAfterReturn(int Idx, ReadOrWrite w) argument
114 StackOverflow(int Idx) argument
[all...]
/external/llvm/lib/Target/AMDGPU/
H A DAMDGPUIntrinsicInfo.cpp53 int Idx = Intrinsic::lookupLLVMIntrinsicByName(IntrinsicNameTable, Name);
54 if (Idx >= 0) {
55 bool IsPrefixMatch = Name.size() > strlen(IntrinsicNameTable[Idx]);
56 return IsPrefixMatch == isOverloaded(Idx + 1)
57 ? Intrinsic::num_intrinsics + Idx
/external/clang/lib/Serialization/
H A DASTReaderStmt.cpp35 unsigned &Idx; member in class:clang::ASTStmtReader
83 const ASTReader::RecordData &Record, unsigned &Idx)
84 : Reader(Reader), F(F), DeclsCursor(Cursor), Record(Record), Idx(Idx) { }
112 SourceLocation TemplateKWLoc = ReadSourceLocation(Record, Idx);
114 ArgInfo.setLAngleLoc(ReadSourceLocation(Record, Idx));
115 ArgInfo.setRAngleLoc(ReadSourceLocation(Record, Idx));
118 Reader.ReadTemplateArgumentLoc(F, Record, Idx));
123 assert(Idx == NumStmtFields && "Incorrect statement field count");
128 S->setSemiLoc(ReadSourceLocation(Record, Idx));
81 ASTStmtReader(ASTReader &Reader, ModuleFile &F, llvm::BitstreamCursor &Cursor, const ASTReader::RecordData &Record, unsigned &Idx) argument
1761 unsigned &Idx; member in class:clang::OMPClauseReader
1763 OMPClauseReader(ASTStmtReader *R, ASTContext &C, const ASTReader::RecordData &Record, unsigned &Idx) argument
2815 unsigned Idx; local
[all...]
H A DASTReaderDecl.cpp45 unsigned &Idx; member in class:clang::ASTDeclReader
92 for (unsigned I = 0, Size = Record[Idx++]; I != Size; ++I)
93 IDs.push_back(ReadDeclID(Record, Idx));
220 const RecordData &Record, unsigned &Idx)
222 ThisDeclLoc(ThisDeclLoc), Record(Record), Idx(Idx),
463 GetTypeSourceInfo(Record, Idx);
466 DD->DeclInfo = GetTypeSourceInfo(Record, Idx);
487 if (Record[Idx++]) {
489 CD->NumCtorInitializers = Record[Idx
218 ASTDeclReader(ASTReader &Reader, ASTReader::RecordLocation Loc, DeclID thisDeclID, SourceLocation ThisDeclLoc, const RecordData &Record, unsigned &Idx) argument
1460 ReadCXXDefinitionData( struct CXXRecordDecl::DefinitionData &Data, const RecordData &Record, unsigned &Idx) argument
2461 ReadAttributes(ModuleFile &F, AttrVec &Attrs, const RecordData &Record, unsigned &Idx) argument
3220 unsigned Idx = 0; local
3505 unsigned Idx = 0; local
[all...]
/external/llvm/include/llvm/Transforms/IPO/
H A DDeadArgumentElimination.h40 RetOrArg(const Function *F, unsigned Idx, bool IsArg) argument
41 : F(F), Idx(Idx), IsArg(IsArg) {}
43 unsigned Idx; member in struct:llvm::DeadArgumentEliminationPass::RetOrArg
48 return std::tie(F, Idx, IsArg) < std::tie(O.F, O.Idx, O.IsArg);
53 return F == O.F && Idx == O.Idx && IsArg == O.IsArg;
57 return (Twine(IsArg ? "Argument #" : "Return value #") + Twine(Idx) +
71 RetOrArg CreateRet(const Function *F, unsigned Idx) { argument
75 CreateArg(const Function *F, unsigned Idx) argument
[all...]
/external/swiftshader/third_party/LLVM/lib/VMCore/
H A DDebugLoc.cpp193 int &Idx = ScopeRecordIdx[Scope]; local
194 if (Idx) return Idx;
198 return Idx = ExistingIdx;
208 Idx = ScopeRecords.size()+1;
209 ScopeRecords.push_back(DebugRecVH(Scope, this, Idx));
210 return Idx;
216 int &Idx = ScopeInlinedAtIdx[std::make_pair(Scope, IA)]; local
217 if (Idx) return Idx;
[all...]
/external/llvm/include/llvm/ADT/
H A DPackedVector.h30 static T getValue(const BitVectorTy &Bits, unsigned Idx) { argument
33 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i));
37 static void setValue(BitVectorTy &Bits, unsigned Idx, T val) { argument
40 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i);
47 static T getValue(const BitVectorTy &Bits, unsigned Idx) { argument
50 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i));
51 if (Bits[(Idx << (BitNum-1)) + BitNum-1])
56 static void setValue(BitVectorTy &Bits, unsigned Idx, T val) { argument
59 Bits.set((Idx << (BitNum-1)) + BitNum-1);
63 Bits[(Idx << (BitNu
84 const unsigned Idx; member in class:llvm::PackedVector::reference
122 operator [](unsigned Idx) argument
[all...]
H A DSparseMultiSet.h164 unsigned Idx = FreelistIdx; local
165 unsigned NextFree = Dense[Idx].Next;
166 assert(Dense[Idx].isTombstone() && "Non-tombstone free?");
168 Dense[Idx] = SMSNode(V, Prev, Next);
171 return Idx;
175 void makeTombstone(unsigned Idx) { argument
176 Dense[Idx].Prev = SMSNode::INVALID;
177 Dense[Idx].Next = FreelistIdx;
178 FreelistIdx = Idx;
222 unsigned Idx; member in class:llvm::SparseMultiSet::iterator_base
350 findIndex(unsigned Idx) argument
[all...]
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
H A DPackedVector.h30 static T getValue(const llvm::BitVector &Bits, unsigned Idx) { argument
33 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i));
37 static void setValue(llvm::BitVector &Bits, unsigned Idx, T val) { argument
40 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i);
47 static T getValue(const llvm::BitVector &Bits, unsigned Idx) { argument
50 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i));
51 if (Bits[(Idx << (BitNum-1)) + BitNum-1])
56 static void setValue(llvm::BitVector &Bits, unsigned Idx, T val) { argument
59 Bits.set((Idx << (BitNum-1)) + BitNum-1);
63 Bits[(Idx << (BitNu
83 const unsigned Idx; member in class:llvm::PackedVector::reference
121 operator [](unsigned Idx) argument
[all...]
H A DBitVector.h46 reference(BitVector &b, unsigned Idx) { argument
47 WordRef = &b.Bits[Idx / BITWORD_SIZE];
48 BitPos = Idx % BITWORD_SIZE;
230 BitVector &set(unsigned Idx) { argument
231 Bits[Idx / BITWORD_SIZE] |= 1L << (Idx % BITWORD_SIZE);
240 BitVector &reset(unsigned Idx) { argument
241 Bits[Idx / BITWORD_SIZE] &= ~(1L << (Idx % BITWORD_SIZE));
252 BitVector &flip(unsigned Idx) { argument
263 operator [](unsigned Idx) argument
[all...]
/external/llvm/lib/Target/Hexagon/
H A DHexagonBlockRanges.h56 IndexType(unsigned Idx) : Index(Idx) {} argument
59 bool operator== (IndexType Idx) const;
61 bool operator!= (IndexType Idx) const;
63 bool operator< (unsigned Idx) const;
64 bool operator< (IndexType Idx) const;
65 bool operator<= (IndexType Idx) const;
68 bool operator> (IndexType Idx) const;
69 bool operator>= (IndexType Idx) const;
121 MachineInstr *getInstr(IndexType Idx) cons
[all...]
/external/llvm/include/llvm/Support/
H A DArrayRecycler.h43 // Remove an entry from the free list in Bucket[Idx] and return it.
45 T *pop(unsigned Idx) { argument
46 if (Idx >= Bucket.size())
48 FreeList *Entry = Bucket[Idx];
51 Bucket[Idx] = Entry->Next;
55 // Add an entry to the free list at Bucket[Idx].
56 void push(unsigned Idx, T *Ptr) { argument
59 if (Idx >= Bucket.size())
60 Bucket.resize(size_t(Idx) + 1);
61 Entry->Next = Bucket[Idx];
[all...]
/external/llvm/lib/MC/
H A DMCRegisterInfo.cpp26 unsigned MCRegisterInfo::getSubReg(unsigned Reg, unsigned Idx) const {
27 assert(Idx && Idx < getNumSubRegIndices() &&
33 if (*SRI == Idx)
49 unsigned MCRegisterInfo::getSubRegIdxSize(unsigned Idx) const {
50 assert(Idx && Idx < getNumSubRegIndices() &&
52 return SubRegIdxRanges[Idx].Size;
55 unsigned MCRegisterInfo::getSubRegIdxOffset(unsigned Idx) const {
56 assert(Idx
[all...]
/external/llvm/lib/Target/NVPTX/
H A DNVPTXMachineFunctionInfo.h44 const char *getImageHandleSymbol(unsigned Idx) const {
45 assert(ImageHandleList.size() > Idx && "Bad index");
46 return ImageHandleList[Idx].c_str();
/external/compiler-rt/lib/esan/
H A Desan_circular_buffer.h48 T &operator[](uptr Idx) { argument
49 CHECK_LT(Idx, Count);
50 uptr ArrayIdx = (StartIdx + Idx) % Capacity;
53 const T &operator[](uptr Idx) const {
54 CHECK_LT(Idx, Count);
55 uptr ArrayIdx = (StartIdx + Idx) % Capacity;
/external/llvm/include/llvm/CodeGen/
H A DRegisterClassInfo.h134 unsigned getRegPressureSetLimit(unsigned Idx) const {
135 if (!PSetLimits[Idx])
136 PSetLimits[Idx] = computePSetLimit(Idx);
137 return PSetLimits[Idx];
141 unsigned computePSetLimit(unsigned Idx) const;
/external/swiftshader/third_party/LLVM/include/llvm/
H A DAttributes.h170 static AttributeWithIndex get(unsigned Idx, Attributes Attrs) { argument
172 P.Index = Idx;
214 AttrListPtr addAttr(unsigned Idx, Attributes Attrs) const;
219 AttrListPtr removeAttr(unsigned Idx, Attributes Attrs) const;
226 Attributes getParamAttributes(unsigned Idx) const {
227 assert (Idx && Idx != ~0U && "Invalid parameter index!");
228 return getAttributes(Idx);
244 bool paramHasAttr(unsigned Idx, Attributes Attr) const { argument
245 return (getAttributes(Idx)
[all...]
/external/swiftshader/third_party/LLVM/lib/Target/ARM/MCTargetDesc/
H A DARMMCTargetDesc.cpp42 unsigned Idx = 0; local
47 Idx = 4;
51 Idx = 6;
55 if (Idx) {
56 unsigned SubVer = TT[Idx];
58 if (Len >= Idx+2 && TT[Idx+1] == 'm') {
61 } else if (Len >= Idx+3 && TT[Idx+1] == 'e'&& TT[Idx
[all...]
/external/llvm/lib/Fuzzer/
H A DFuzzerMutate.cpp79 size_t Idx = Rand(Corpus->size());
80 const Unit &Other = (*Corpus)[Idx];
110 size_t Idx = Rand(Size);
111 // Erase Data[Idx].
112 memmove(Data + Idx, Data + Idx + 1, Size - Idx - 1);
119 size_t Idx = Rand(Size + 1);
120 // Insert new value at Data[Idx].
121 memmove(Data + Idx
128 size_t Idx = Rand(Size); local
135 size_t Idx = Rand(Size); local
165 size_t Idx = UsePositionHint ? DE.GetPositionHint() : Rand(Size + 1); local
[all...]
/external/clang/lib/StaticAnalyzer/Checkers/
H A DArrayBoundChecker.cpp48 DefinedOrUnknownSVal Idx = ER->getIndex().castAs<DefinedOrUnknownSVal>();
52 if (Idx.isZeroConstant())
62 ProgramStateRef StInBound = state->assumeInBound(Idx, NumElements, true);
63 ProgramStateRef StOutBound = state->assumeInBound(Idx, NumElements, false);
H A DReturnPointerRangeChecker.cpp50 DefinedOrUnknownSVal Idx = ER->getIndex().castAs<DefinedOrUnknownSVal>();
53 if (Idx.isZeroConstant())
62 ProgramStateRef StInBound = state->assumeInBound(Idx, NumElements, true);
63 ProgramStateRef StOutBound = state->assumeInBound(Idx, NumElements, false);
/external/llvm/unittests/ADT/
H A DSCCIteratorTest.cpp27 static void ValidateIndex(unsigned Idx) { argument
28 assert(Idx < N && "Invalid node index!");
52 void AddNode(unsigned Idx) {
53 ValidateIndex(Idx);
54 Elements |= 1U << Idx;
58 void DeleteNode(unsigned Idx) {
59 ValidateIndex(Idx);
60 Elements &= ~(1U << Idx);
64 bool count(unsigned Idx) {
65 ValidateIndex(Idx);
[all...]
/external/swiftshader/third_party/LLVM/lib/Target/X86/
H A DX86MachineFunctionInfo.h118 void setVarArgsFrameIndex(int Idx) { VarArgsFrameIndex = Idx; } argument
121 void setRegSaveFrameIndex(int Idx) { RegSaveFrameIndex = Idx; } argument
/external/swiftshader/third_party/LLVM/unittests/ADT/
H A DSCCIteratorTest.cpp27 static void ValidateIndex(unsigned Idx) { argument
28 assert(Idx < N && "Invalid node index!");
54 void AddNode(unsigned Idx) {
55 ValidateIndex(Idx);
56 Elements |= 1U << Idx;
60 void DeleteNode(unsigned Idx) {
61 ValidateIndex(Idx);
62 Elements &= ~(1U << Idx);
66 bool count(unsigned Idx) {
67 ValidateIndex(Idx);
[all...]
/external/llvm/lib/DebugInfo/PDB/Raw/
H A DNameMap.cpp80 for (unsigned Idx = 0; Idx < 32; ++Idx)
81 if (Word & (1U << Idx))
82 Present.set((I * 32) + Idx);
105 for (unsigned Idx = 0; Idx < 32; ++Idx)
106 if (Word & (1U << Idx))
107 Deleted.set((I * 32) + Idx);
[all...]

Completed in 1901 milliseconds

1234567891011>>