Home
last modified time | relevance | path

Searched refs:Idx (Results 1 – 25 of 264) sorted by relevance

1234567891011

/external/clang/lib/Serialization/
DASTReaderStmt.cpp35 unsigned &Idx; member in clang::ASTStmtReader
83 const ASTReader::RecordData &Record, unsigned &Idx) in ASTStmtReader() argument
84 : Reader(Reader), F(F), DeclsCursor(Cursor), Record(Record), Idx(Idx) { } in ASTStmtReader()
111 SourceLocation TemplateKWLoc = ReadSourceLocation(Record, Idx); in ReadTemplateKWAndArgsInfo()
113 ArgInfo.setLAngleLoc(ReadSourceLocation(Record, Idx)); in ReadTemplateKWAndArgsInfo()
114 ArgInfo.setRAngleLoc(ReadSourceLocation(Record, Idx)); in ReadTemplateKWAndArgsInfo()
117 Reader.ReadTemplateArgumentLoc(F, Record, Idx)); in ReadTemplateKWAndArgsInfo()
122 assert(Idx == NumStmtFields && "Incorrect statement field count"); in VisitStmt()
127 S->setSemiLoc(ReadSourceLocation(Record, Idx)); in VisitNullStmt()
128 S->HasLeadingEmptyMacro = Record[Idx++]; in VisitNullStmt()
[all …]
DASTReaderDecl.cpp44 unsigned &Idx; member in clang::ASTDeclReader
193 const RecordData &Record, unsigned &Idx) in ASTDeclReader() argument
195 RawLocation(RawLocation), Record(Record), Idx(Idx), in ASTDeclReader()
325 GetTypeSourceInfo(Record, Idx); in Visit()
328 DD->DeclInfo = GetTypeSourceInfo(Record, Idx); in Visit()
344 if (Record[Idx++]) { in Visit()
357 GlobalDeclID SemaDCIDForTemplateParmDecl = ReadDeclID(Record, Idx); in VisitDecl()
358 GlobalDeclID LexicalDCIDForTemplateParmDecl = ReadDeclID(Record, Idx); in VisitDecl()
364 DeclContext *SemaDC = ReadDeclAs<DeclContext>(Record, Idx); in VisitDecl()
365 DeclContext *LexicalDC = ReadDeclAs<DeclContext>(Record, Idx); in VisitDecl()
[all …]
DASTReader.cpp786 unsigned Idx = 0; in ParseLineTable() local
791 for (int I = 0, N = Record[Idx++]; I != N; ++I) { in ParseLineTable()
793 unsigned FilenameLen = Record[Idx++]; in ParseLineTable()
794 std::string Filename(&Record[Idx], &Record[Idx] + FilenameLen); in ParseLineTable()
795 Idx += FilenameLen; in ParseLineTable()
802 while (Idx < Record.size()) { in ParseLineTable()
803 int FID = Record[Idx++]; in ParseLineTable()
809 unsigned NumEntries = Record[Idx++]; in ParseLineTable()
814 unsigned FileOffset = Record[Idx++]; in ParseLineTable()
815 unsigned LineNo = Record[Idx++]; in ParseLineTable()
[all …]
DGlobalModuleIndex.cpp174 unsigned Idx = 0; in GlobalModuleIndex() local
175 unsigned ID = Record[Idx++]; in GlobalModuleIndex()
185 Modules[ID].Size = Record[Idx++]; in GlobalModuleIndex()
186 Modules[ID].ModTime = Record[Idx++]; in GlobalModuleIndex()
189 unsigned NameLen = Record[Idx++]; in GlobalModuleIndex()
190 Modules[ID].FileName.assign(Record.begin() + Idx, in GlobalModuleIndex()
191 Record.begin() + Idx + NameLen); in GlobalModuleIndex()
192 Idx += NameLen; in GlobalModuleIndex()
195 unsigned NumDeps = Record[Idx++]; in GlobalModuleIndex()
197 Record.begin() + Idx, in GlobalModuleIndex()
[all …]
/external/llvm/lib/IR/
DDebugLoc.cpp164 int &Idx = ScopeRecordIdx[Scope]; in getOrAddScopeRecordIdxEntry() local
165 if (Idx) return Idx; in getOrAddScopeRecordIdxEntry()
169 return Idx = ExistingIdx; in getOrAddScopeRecordIdxEntry()
179 Idx = ScopeRecords.size()+1; in getOrAddScopeRecordIdxEntry()
180 ScopeRecords.push_back(DebugRecVH(Scope, this, Idx)); in getOrAddScopeRecordIdxEntry()
181 return Idx; in getOrAddScopeRecordIdxEntry()
187 int &Idx = ScopeInlinedAtIdx[std::make_pair(Scope, IA)]; in getOrAddScopeInlinedAtIdxEntry() local
188 if (Idx) return Idx; in getOrAddScopeInlinedAtIdxEntry()
192 return Idx = ExistingIdx; in getOrAddScopeInlinedAtIdxEntry()
200 Idx = -ScopeInlinedAtRecords.size()-1; in getOrAddScopeInlinedAtIdxEntry()
[all …]
/external/llvm/include/llvm/ADT/
DSparseMultiSet.h160 unsigned Idx = FreelistIdx; in addValue() local
161 unsigned NextFree = Dense[Idx].Next; in addValue()
162 assert(Dense[Idx].isTombstone() && "Non-tombstone free?"); in addValue()
164 Dense[Idx] = SMSNode(V, Prev, Next); in addValue()
167 return Idx; in addValue()
171 void makeTombstone(unsigned Idx) { in makeTombstone() argument
172 Dense[Idx].Prev = SMSNode::INVALID; in makeTombstone()
173 Dense[Idx].Next = FreelistIdx; in makeTombstone()
174 FreelistIdx = Idx; in makeTombstone()
217 unsigned Idx; variable
[all …]
DPackedVector.h30 static T getValue(const BitVectorTy &Bits, unsigned Idx) { in getValue() argument
33 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i)); in getValue()
37 static void setValue(BitVectorTy &Bits, unsigned Idx, T val) { in setValue() argument
40 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i); in setValue()
47 static T getValue(const BitVectorTy &Bits, unsigned Idx) { in getValue() argument
50 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i)); in getValue()
51 if (Bits[(Idx << (BitNum-1)) + BitNum-1]) in getValue()
56 static void setValue(BitVectorTy &Bits, unsigned Idx, T val) { in setValue() argument
59 Bits.set((Idx << (BitNum-1)) + BitNum-1); in setValue()
63 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i); in setValue()
[all …]
DSparseBitVector.h66 explicit SparseBitVectorElement(unsigned Idx) {
67 ElementIndex = Idx;
86 BitWord word(unsigned Idx) const {
87 assert (Idx < BITWORDS_PER_ELEMENT);
88 return Bits[Idx];
102 void set(unsigned Idx) {
103 Bits[Idx / BITWORD_SIZE] |= 1L << (Idx % BITWORD_SIZE);
106 bool test_and_set (unsigned Idx) {
107 bool old = test(Idx);
109 set(Idx);
[all …]
DSmallBitVector.h63 reference(SmallBitVector &b, unsigned Idx) : TheVector(b), BitPos(Idx) {} in reference() argument
295 SmallBitVector &set(unsigned Idx) { in set() argument
297 setSmallBits(getSmallBits() | (uintptr_t(1) << Idx)); in set()
299 getPointer()->set(Idx); in set()
326 SmallBitVector &reset(unsigned Idx) { in reset() argument
328 setSmallBits(getSmallBits() & ~(uintptr_t(1) << Idx)); in reset()
330 getPointer()->reset(Idx); in reset()
357 SmallBitVector &flip(unsigned Idx) { in flip() argument
359 setSmallBits(getSmallBits() ^ (uintptr_t(1) << Idx)); in flip()
361 getPointer()->flip(Idx); in flip()
[all …]
DBitVector.h47 reference(BitVector &b, unsigned Idx) { in reference() argument
48 WordRef = &b.Bits[Idx / BITWORD_SIZE]; in reference()
49 BitPos = Idx % BITWORD_SIZE; in reference()
242 BitVector &set(unsigned Idx) { in set() argument
243 Bits[Idx / BITWORD_SIZE] |= 1L << (Idx % BITWORD_SIZE); in set()
280 BitVector &reset(unsigned Idx) { in reset() argument
281 Bits[Idx / BITWORD_SIZE] &= ~(1L << (Idx % BITWORD_SIZE)); in reset()
320 BitVector &flip(unsigned Idx) { in flip() argument
321 Bits[Idx / BITWORD_SIZE] ^= 1L << (Idx % BITWORD_SIZE); in flip()
326 reference operator[](unsigned Idx) {
[all …]
/external/llvm/utils/TableGen/
DCodeGenSchedule.h61 CodeGenSchedRW(unsigned Idx, Record *Def) in CodeGenSchedRW()
62 : Index(Idx), TheDef(Def), IsAlias(false), IsVariadic(false) { in CodeGenSchedRW()
75 CodeGenSchedRW(unsigned Idx, bool Read, const IdxVec &Seq, in CodeGenSchedRW()
77 : Index(Idx), Name(Name), TheDef(0), IsRead(Read), IsAlias(false), in CodeGenSchedRW()
199 CodeGenProcModel(unsigned Idx, const std::string &Name, Record *MDef, in CodeGenProcModel()
201 Index(Idx), ModelName(Name), ModelDef(MDef), ItinsDef(IDef) {} in CodeGenProcModel()
287 const CodeGenSchedRW &getSchedWrite(unsigned Idx) const { in getSchedWrite() argument
288 assert(Idx < SchedWrites.size() && "bad SchedWrite index"); in getSchedWrite()
289 assert(SchedWrites[Idx].isValid() && "invalid SchedWrite"); in getSchedWrite()
290 return SchedWrites[Idx]; in getSchedWrite()
[all …]
/external/llvm/lib/Target/ARM/MCTargetDesc/
DARMMCTargetDesc.cpp46 unsigned Idx = 0; in ParseARMTriple() local
51 Idx = 4; in ParseARMTriple()
55 Idx = 6; in ParseARMTriple()
60 if (Idx) { in ParseARMTriple()
61 unsigned SubVer = TT[Idx]; in ParseARMTriple()
66 if (Len >= Idx+2 && TT[Idx+1] == 'm') { in ParseARMTriple()
74 } else if (Len >= Idx+3 && TT[Idx+1] == 'e'&& TT[Idx+2] == 'm') { in ParseARMTriple()
82 } else if (Len >= Idx+2 && TT[Idx+1] == 's') { in ParseARMTriple()
103 if (Len >= Idx+3 && TT[Idx+1] == 't' && TT[Idx+2] == '2') in ParseARMTriple()
105 else if (Len >= Idx+2 && TT[Idx+1] == 'm') { in ParseARMTriple()
[all …]
/external/llvm/lib/MC/
DMCRegisterInfo.cpp26 unsigned MCRegisterInfo::getSubReg(unsigned Reg, unsigned Idx) const { in getSubReg()
27 assert(Idx && Idx < getNumSubRegIndices() && in getSubReg()
33 if (*SRI == Idx) in getSubReg()
49 unsigned MCRegisterInfo::getSubRegIdxSize(unsigned Idx) const { in getSubRegIdxSize()
50 assert(Idx && Idx < getNumSubRegIndices() && in getSubRegIdxSize()
52 return SubRegIdxRanges[Idx].Size; in getSubRegIdxSize()
55 unsigned MCRegisterInfo::getSubRegIdxOffset(unsigned Idx) const { in getSubRegIdxOffset()
56 assert(Idx && Idx < getNumSubRegIndices() && in getSubRegIdxOffset()
58 return SubRegIdxRanges[Idx].Offset; in getSubRegIdxOffset()
/external/llvm/lib/CodeGen/
DSplitKit.cpp299 bool SplitAnalysis::isOriginalEndpoint(SlotIndex Idx) const { in isOriginalEndpoint()
303 LiveInterval::const_iterator I = Orig.find(Idx); in isOriginalEndpoint()
306 if (I != Orig.end() && I->start <= Idx) in isOriginalEndpoint()
307 return I->start == Idx; in isOriginalEndpoint()
310 return I != Orig.begin() && (--I)->end == Idx; in isOriginalEndpoint()
376 SlotIndex Idx) { in defValue() argument
378 assert(Idx.isValid() && "Invalid SlotIndex"); in defValue()
379 assert(Edit->getParent().getVNInfoAt(Idx) == ParentVNI && "Bad Parent VNI"); in defValue()
383 VNInfo *VNI = LI->getNextValue(Idx, LIS.getVNInfoAllocator()); in defValue()
473 void SplitEditor::selectIntv(unsigned Idx) { in selectIntv() argument
[all …]
DLiveDebugVariables.cpp129 void insertDebugValue(MachineBasicBlock *MBB, SlotIndex Idx, unsigned LocNo,
206 void addDef(SlotIndex Idx, const MachineOperand &LocMO) { in addDef() argument
208 LocMap::iterator I = locInts.find(Idx); in addDef()
209 if (!I.valid() || I.start() != Idx) in addDef()
210 I.insert(Idx, Idx.getNextSlot(), getLocationNo(LocMO)); in addDef()
227 void extendDef(SlotIndex Idx, unsigned LocNo,
314 bool handleDebugValue(MachineInstr *MI, SlotIndex Idx);
448 bool LDVImpl::handleDebugValue(MachineInstr *MI, SlotIndex Idx) { in handleDebugValue() argument
462 UV->addDef(Idx, MI->getOperand(0)); in handleDebugValue()
478 SlotIndex Idx = MBBI == MBB->begin() ? in collectDebugValues() local
[all …]
/external/llvm/unittests/ADT/
DSCCIteratorTest.cpp27 static void ValidateIndex(unsigned Idx) { in ValidateIndex() argument
28 assert(Idx < N && "Invalid node index!"); in ValidateIndex()
54 void AddNode(unsigned Idx) { in AddNode() argument
55 ValidateIndex(Idx); in AddNode()
56 Elements |= 1U << Idx; in AddNode()
60 void DeleteNode(unsigned Idx) { in DeleteNode() argument
61 ValidateIndex(Idx); in DeleteNode()
62 Elements &= ~(1U << Idx); in DeleteNode()
66 bool count(unsigned Idx) { in count() argument
67 ValidateIndex(Idx); in count()
[all …]
DHashingTest.cpp178 for (unsigned Idx = 1, Size = all_one_c.size(); Idx < Size; ++Idx) { in TEST() local
179 hash_code code = hash_combine_range(&all_one_c[0], &all_one_c[0] + Idx); in TEST()
181 I = code_to_size.insert(std::make_pair(code, Idx)).first; in TEST()
182 EXPECT_EQ(Idx, I->second); in TEST()
186 for (unsigned Idx = 1, Size = all_zero_c.size(); Idx < Size; ++Idx) { in TEST() local
187 hash_code code = hash_combine_range(&all_zero_c[0], &all_zero_c[0] + Idx); in TEST()
189 I = code_to_size.insert(std::make_pair(code, Idx)).first; in TEST()
190 EXPECT_EQ(Idx, I->second); in TEST()
194 for (unsigned Idx = 1, Size = all_one_int.size(); Idx < Size; ++Idx) { in TEST() local
195 hash_code code = hash_combine_range(&all_one_int[0], &all_one_int[0] + Idx); in TEST()
[all …]
/external/llvm/lib/Target/AArch64/
DAArch64MachineFunctionInfo.h128 void setVariadicGPRIdx(int Idx) { VariadicGPRIdx = Idx; } in setVariadicGPRIdx() argument
134 void setVariadicFPRIdx(int Idx) { VariadicFPRIdx = Idx; } in setVariadicFPRIdx() argument
140 void setVariadicStackIdx(int Idx) { VariadicStackIdx = Idx; } in setVariadicStackIdx() argument
143 void setFramePointerOffset(int Idx) { FramePointerOffset = Idx; } in setFramePointerOffset() argument
/external/llvm/include/llvm/Support/
DArrayRecycler.h43 T *pop(unsigned Idx) { in pop() argument
44 if (Idx >= Bucket.size()) in pop()
46 FreeList *Entry = Bucket[Idx]; in pop()
49 Bucket[Idx] = Entry->Next; in pop()
54 void push(unsigned Idx, T *Ptr) { in push() argument
59 if (Idx >= Bucket.size()) in push()
60 Bucket.resize(size_t(Idx) + 1); in push()
61 Entry->Next = Bucket[Idx]; in push()
62 Bucket[Idx] = Entry; in push()
/external/llvm/lib/Target/X86/
DX86TargetTransformInfo.cpp214 int Idx = CostTableLookup<MVT>(AVX2CostTable, array_lengthof(AVX2CostTable), in getArithmeticInstrCost() local
216 if (Idx != -1) in getArithmeticInstrCost()
217 return LT.first * AVX2CostTable[Idx].Cost; in getArithmeticInstrCost()
241 int Idx = CostTableLookup<MVT>(SSE2UniformConstCostTable, in getArithmeticInstrCost() local
244 if (Idx != -1) in getArithmeticInstrCost()
245 return LT.first * SSE2UniformConstCostTable[Idx].Cost; in getArithmeticInstrCost()
290 int Idx = CostTableLookup<MVT>(SSE2CostTable, array_lengthof(SSE2CostTable), in getArithmeticInstrCost() local
292 if (Idx != -1) in getArithmeticInstrCost()
293 return LT.first * SSE2CostTable[Idx].Cost; in getArithmeticInstrCost()
315 int Idx = CostTableLookup<MVT>(AVX1CostTable, array_lengthof(AVX1CostTable), in getArithmeticInstrCost() local
[all …]
/external/llvm/lib/ExecutionEngine/OProfileJIT/
DOProfileWrapper.cpp144 ssize_t Idx = 0; in checkForOProfileProcEntry() local
147 while (Idx < NumRead-1 && ExeName[Idx] != 0) { in checkForOProfileProcEntry()
148 Idx++; in checkForOProfileProcEntry()
152 Idx--; in checkForOProfileProcEntry()
155 while (Idx > 0) { in checkForOProfileProcEntry()
156 if (ExeName[Idx] == '/') { in checkForOProfileProcEntry()
157 BaseName = ExeName + Idx + 1; in checkForOProfileProcEntry()
160 Idx--; in checkForOProfileProcEntry()
/external/llvm/include/llvm/CodeGen/
DLiveInterval.h311 const LiveRange *getLiveRangeContaining(SlotIndex Idx) const {
312 const_iterator I = FindLiveRangeContaining(Idx);
318 LiveRange *getLiveRangeContaining(SlotIndex Idx) {
319 iterator I = FindLiveRangeContaining(Idx);
324 VNInfo *getVNInfoAt(SlotIndex Idx) const {
325 const_iterator I = FindLiveRangeContaining(Idx);
332 VNInfo *getVNInfoBefore(SlotIndex Idx) const {
333 const_iterator I = FindLiveRangeContaining(Idx.getPrevSlot());
339 iterator FindLiveRangeContaining(SlotIndex Idx) {
340 iterator I = find(Idx);
[all …]
DRegisterClassInfo.h135 unsigned getRegPressureSetLimit(unsigned Idx) const { in getRegPressureSetLimit() argument
136 if (!PSetLimits[Idx]) in getRegPressureSetLimit()
137 PSetLimits[Idx] = computePSetLimit(Idx); in getRegPressureSetLimit()
138 return PSetLimits[Idx]; in getRegPressureSetLimit()
142 unsigned computePSetLimit(unsigned Idx) const;
/external/clang/unittests/AST/
DCommentParser.cpp94 size_t Idx, in GetChildAt() argument
99 if (Idx >= C->child_count()) in GetChildAt()
101 << "Idx out of range. Idx = " << Idx in GetChildAt()
104 Comment::child_iterator I = C->child_begin() + Idx; in GetChildAt()
119 size_t Idx, in HasTextAt() argument
122 ::testing::AssertionResult AR = GetChildAt(C, Idx, TC); in HasTextAt()
140 size_t Idx, in HasTextWithNewlineAt() argument
143 ::testing::AssertionResult AR = GetChildAt(C, Idx, TC); in HasTextWithNewlineAt()
162 size_t Idx, in HasBlockCommandAt() argument
166 ::testing::AssertionResult AR = GetChildAt(C, Idx, BCC); in HasBlockCommandAt()
[all …]
/external/llvm/lib/Transforms/Instrumentation/
DThreadSanitizer.cpp403 int Idx = getMemoryAccessFuncIndex(Addr); in instrumentLoadOrStore() local
404 if (Idx < 0) in instrumentLoadOrStore()
425 Value *OnAccessFunc = IsWrite ? TsanWrite[Idx] : TsanRead[Idx]; in instrumentLoadOrStore()
500 int Idx = getMemoryAccessFuncIndex(Addr); in instrumentAtomic() local
501 if (Idx < 0) in instrumentAtomic()
503 const size_t ByteSize = 1 << Idx; in instrumentAtomic()
509 CallInst *C = CallInst::Create(TsanAtomicLoad[Idx], in instrumentAtomic()
515 int Idx = getMemoryAccessFuncIndex(Addr); in instrumentAtomic() local
516 if (Idx < 0) in instrumentAtomic()
518 const size_t ByteSize = 1 << Idx; in instrumentAtomic()
[all …]

1234567891011