Home
last modified time | relevance | path

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

12345678910>>...16

/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.cpp45 unsigned &Idx; member in clang::ASTDeclReader
72 for (unsigned I = 0, Size = Record[Idx++]; I != Size; ++I) in ReadDeclIDList()
73 IDs.push_back(ReadDeclID(Record, Idx)); in ReadDeclIDList()
199 unsigned RawLocation, const RecordData &Record, unsigned &Idx) in ASTDeclReader() argument
201 RawLocation(RawLocation), Record(Record), Idx(Idx), in ASTDeclReader()
431 GetTypeSourceInfo(Record, Idx); in Visit()
434 DD->DeclInfo = GetTypeSourceInfo(Record, Idx); in Visit()
455 if (Record[Idx++]) { in Visit()
457 CD->NumCtorInitializers = Record[Idx++]; in Visit()
460 Reader.ReadCXXCtorInitializersRef(F, Record, Idx); in Visit()
[all …]
DASTReader.cpp1063 unsigned Idx = 0; in ParseLineTable() local
1068 for (unsigned I = 0; Record[Idx]; ++I) { in ParseLineTable()
1070 auto Filename = ReadPath(F, Record, Idx); in ParseLineTable()
1073 ++Idx; in ParseLineTable()
1077 while (Idx < Record.size()) { in ParseLineTable()
1078 int FID = Record[Idx++]; in ParseLineTable()
1084 unsigned NumEntries = Record[Idx++]; in ParseLineTable()
1089 unsigned FileOffset = Record[Idx++]; in ParseLineTable()
1090 unsigned LineNo = Record[Idx++]; in ParseLineTable()
1091 int FilenameID = FileIDs[Record[Idx++]]; in ParseLineTable()
[all …]
DGlobalModuleIndex.cpp178 unsigned Idx = 0; in GlobalModuleIndex() local
179 unsigned ID = Record[Idx++]; in GlobalModuleIndex()
189 Modules[ID].Size = Record[Idx++]; in GlobalModuleIndex()
190 Modules[ID].ModTime = Record[Idx++]; in GlobalModuleIndex()
193 unsigned NameLen = Record[Idx++]; in GlobalModuleIndex()
194 Modules[ID].FileName.assign(Record.begin() + Idx, in GlobalModuleIndex()
195 Record.begin() + Idx + NameLen); in GlobalModuleIndex()
196 Idx += NameLen; in GlobalModuleIndex()
199 unsigned NumDeps = Record[Idx++]; in GlobalModuleIndex()
201 Record.begin() + Idx, in GlobalModuleIndex()
[all …]
/external/llvm/include/llvm/ADT/
DSparseMultiSet.h164 unsigned Idx = FreelistIdx; in addValue() local
165 unsigned NextFree = Dense[Idx].Next; in addValue()
166 assert(Dense[Idx].isTombstone() && "Non-tombstone free?"); in addValue()
168 Dense[Idx] = SMSNode(V, Prev, Next); in addValue()
171 return Idx; in addValue()
175 void makeTombstone(unsigned Idx) { in makeTombstone() argument
176 Dense[Idx].Prev = SMSNode::INVALID; in makeTombstone()
177 Dense[Idx].Next = FreelistIdx; in makeTombstone()
178 FreelistIdx = Idx; in makeTombstone()
222 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 …]
DSmallBitVector.h67 reference(SmallBitVector &b, unsigned Idx) : TheVector(b), BitPos(Idx) {} in reference() argument
287 SmallBitVector &set(unsigned Idx) { in set() argument
289 assert(Idx <= static_cast<unsigned>( in set()
292 setSmallBits(getSmallBits() | (uintptr_t(1) << Idx)); in set()
295 getPointer()->set(Idx); in set()
322 SmallBitVector &reset(unsigned Idx) { in reset() argument
324 setSmallBits(getSmallBits() & ~(uintptr_t(1) << Idx)); in reset()
326 getPointer()->reset(Idx); in reset()
353 SmallBitVector &flip(unsigned Idx) { in flip() argument
355 setSmallBits(getSmallBits() ^ (uintptr_t(1) << Idx)); in flip()
[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 …]
DBitVector.h51 reference(BitVector &b, unsigned Idx) { in reference() argument
52 WordRef = &b.Bits[Idx / BITWORD_SIZE]; in reference()
53 BitPos = Idx % BITWORD_SIZE; in reference()
224 BitVector &set(unsigned Idx) { in set() argument
226 Bits[Idx / BITWORD_SIZE] |= BitWord(1) << (Idx % BITWORD_SIZE); in set()
264 BitVector &reset(unsigned Idx) { in reset() argument
265 Bits[Idx / BITWORD_SIZE] &= ~(BitWord(1) << (Idx % BITWORD_SIZE)); in reset()
305 BitVector &flip(unsigned Idx) { in flip() argument
306 Bits[Idx / BITWORD_SIZE] ^= BitWord(1) << (Idx % BITWORD_SIZE); in flip()
311 reference operator[](unsigned Idx) {
[all …]
/external/llvm/lib/Fuzzer/
DFuzzerMutate.cpp83 size_t Idx = Rand(Size); in Mutate_EraseByte() local
85 memmove(Data + Idx, Data + Idx + 1, Size - Idx - 1); in Mutate_EraseByte()
92 size_t Idx = Rand(Size + 1); in Mutate_InsertByte() local
94 memmove(Data + Idx + 1, Data + Idx, Size - Idx); in Mutate_InsertByte()
95 Data[Idx] = RandCh(Rand); in Mutate_InsertByte()
101 size_t Idx = Rand(Size); in Mutate_ChangeByte() local
102 Data[Idx] = RandCh(Rand); in Mutate_ChangeByte()
108 size_t Idx = Rand(Size); in Mutate_ChangeBit() local
109 Data[Idx] = FlipRandomBit(Data[Idx], Rand); in Mutate_ChangeBit()
121 size_t Idx = Rand(Size + 1); in Mutate_AddWordFromDictionary() local
[all …]
/external/llvm/lib/CodeGen/
DSplitKit.cpp295 bool SplitAnalysis::isOriginalEndpoint(SlotIndex Idx) const { in isOriginalEndpoint()
299 LiveInterval::const_iterator I = Orig.find(Idx); in isOriginalEndpoint()
302 if (I != Orig.end() && I->start <= Idx) in isOriginalEndpoint()
303 return I->start == Idx; in isOriginalEndpoint()
306 return I != Orig.begin() && (--I)->end == Idx; in isOriginalEndpoint()
364 SlotIndex Idx) { in defValue() argument
366 assert(Idx.isValid() && "Invalid SlotIndex"); in defValue()
367 assert(Edit->getParent().getVNInfoAt(Idx) == ParentVNI && "Bad Parent VNI"); in defValue()
371 VNInfo *VNI = LI->getNextValue(Idx, LIS.getVNInfoAllocator()); in defValue()
462 void SplitEditor::selectIntv(unsigned Idx) { in selectIntv() argument
[all …]
DLiveDebugVariables.cpp132 void insertDebugValue(MachineBasicBlock *MBB, SlotIndex Idx, unsigned LocNo,
211 void addDef(SlotIndex Idx, const MachineOperand &LocMO) { in addDef() argument
213 LocMap::iterator I = locInts.find(Idx); in addDef()
214 if (!I.valid() || I.start() != Idx) in addDef()
215 I.insert(Idx, Idx.getNextSlot(), getLocationNo(LocMO)); in addDef()
232 void extendDef(SlotIndex Idx, unsigned LocNo,
314 bool handleDebugValue(MachineInstr *MI, SlotIndex Idx);
488 bool LDVImpl::handleDebugValue(MachineInstr *MI, SlotIndex Idx) { in handleDebugValue() argument
505 UV->addDef(Idx, MI->getOperand(0)); in handleDebugValue()
521 SlotIndex Idx = MBBI == MBB->begin() ? in collectDebugValues() local
[all …]
DMachineDominators.cpp74 size_t Idx = 0; in applySplitCriticalEdges() local
105 IsNewIDom[Idx] = false; in applySplitCriticalEdges()
109 ++Idx; in applySplitCriticalEdges()
113 Idx = 0; in applySplitCriticalEdges()
121 if (IsNewIDom[Idx]) in applySplitCriticalEdges()
123 ++Idx; in applySplitCriticalEdges()
/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, ArrayRef<unsigned> Seq, in CodeGenSchedRW()
77 : Index(Idx), Name(Name), TheDef(nullptr), IsRead(Read), IsAlias(false), in CodeGenSchedRW()
200 CodeGenProcModel(unsigned Idx, const std::string &Name, Record *MDef, in CodeGenProcModel()
202 Index(Idx), ModelName(Name), ModelDef(MDef), ItinsDef(IDef) {} in CodeGenProcModel()
308 const CodeGenSchedRW &getSchedWrite(unsigned Idx) const { in getSchedWrite() argument
309 assert(Idx < SchedWrites.size() && "bad SchedWrite index"); in getSchedWrite()
310 assert(SchedWrites[Idx].isValid() && "invalid SchedWrite"); in getSchedWrite()
311 return SchedWrites[Idx]; in getSchedWrite()
[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/Target/SystemZ/
DSystemZTargetTransformInfo.cpp66 int SystemZTTIImpl::getIntImmCost(unsigned Opcode, unsigned Idx, in getIntImmCost() argument
86 if (Idx == 0) in getIntImmCost()
90 if (Idx == 0 && Imm.getBitWidth() <= 64) { in getIntImmCost()
100 if (Idx == 1 && Imm.getBitWidth() <= 64) { in getIntImmCost()
111 if (Idx == 1 && Imm.getBitWidth() <= 64) { in getIntImmCost()
121 if (Idx == 1 && Imm.getBitWidth() <= 64) { in getIntImmCost()
129 if (Idx == 1 && Imm.getBitWidth() <= 64) { in getIntImmCost()
139 if (Idx == 1 && Imm.getBitWidth() <= 64) { in getIntImmCost()
160 if (Idx == 1) in getIntImmCost()
184 int SystemZTTIImpl::getIntImmCost(Intrinsic::ID IID, unsigned Idx, in getIntImmCost() argument
[all …]
/external/llvm/lib/Transforms/Scalar/
DConstantHoisting.cpp69 ConstantUser(Instruction *Inst, unsigned Idx) : Inst(Inst), OpndIdx(Idx) { } in ConstantUser()
82 void addUser(Instruction *Inst, unsigned Idx, unsigned Cost) { in addUser()
84 Uses.push_back(ConstantUser(Inst, Idx)); in addUser()
157 Instruction *findMatInsertPt(Instruction *Inst, unsigned Idx = ~0U) const;
160 Instruction *Inst, unsigned Idx,
215 unsigned Idx) const { in findMatInsertPt()
218 if (Idx != ~0U) { in findMatInsertPt()
219 Value *Opnd = Inst->getOperand(Idx); in findMatInsertPt()
232 if (Idx != ~0U && isa<PHINode>(Inst)) in findMatInsertPt()
233 return cast<PHINode>(Inst)->getIncomingBlock(Idx)->getTerminator(); in findMatInsertPt()
[all …]
DStraightLineStrengthReduce.cpp94 Candidate(Kind CT, const SCEV *B, ConstantInt *Idx, Value *S, in Candidate()
96 : CandidateKind(CT), Base(B), Index(Idx), Stride(S), Ins(I), in Candidate()
176 void allocateCandidatesAndFindBasisForGEP(const SCEV *B, ConstantInt *Idx,
182 ConstantInt *Idx, Value *S,
330 Candidate::Kind CT, const SCEV *B, ConstantInt *Idx, Value *S, in allocateCandidatesAndFindBasis() argument
332 Candidate C(CT, B, Idx, S, I); in allocateCandidatesAndFindBasis()
396 ConstantInt *Idx = nullptr; in allocateCandidatesAndFindBasisForAdd() local
397 if (match(RHS, m_Mul(m_Value(S), m_ConstantInt(Idx)))) { in allocateCandidatesAndFindBasisForAdd()
399 allocateCandidatesAndFindBasis(Candidate::Add, SE->getSCEV(LHS), Idx, S, I); in allocateCandidatesAndFindBasisForAdd()
400 } else if (match(RHS, m_Shl(m_Value(S), m_ConstantInt(Idx)))) { in allocateCandidatesAndFindBasisForAdd()
[all …]
/external/llvm/unittests/ADT/
DSCCIteratorTest.cpp27 static void ValidateIndex(unsigned Idx) { in ValidateIndex() argument
28 assert(Idx < N && "Invalid node index!"); in ValidateIndex()
52 void AddNode(unsigned Idx) { in AddNode() argument
53 ValidateIndex(Idx); in AddNode()
54 Elements |= 1U << Idx; in AddNode()
58 void DeleteNode(unsigned Idx) { in DeleteNode() argument
59 ValidateIndex(Idx); in DeleteNode()
60 Elements &= ~(1U << Idx); in DeleteNode()
64 bool count(unsigned Idx) { in count() argument
65 ValidateIndex(Idx); in count()
[all …]
DHashingTest.cpp177 for (unsigned Idx = 1, Size = all_one_c.size(); Idx < Size; ++Idx) { in TEST() local
178 hash_code code = hash_combine_range(&all_one_c[0], &all_one_c[0] + Idx); in TEST()
180 I = code_to_size.insert(std::make_pair(code, Idx)).first; in TEST()
181 EXPECT_EQ(Idx, I->second); in TEST()
185 for (unsigned Idx = 1, Size = all_zero_c.size(); Idx < Size; ++Idx) { in TEST() local
186 hash_code code = hash_combine_range(&all_zero_c[0], &all_zero_c[0] + Idx); in TEST()
188 I = code_to_size.insert(std::make_pair(code, Idx)).first; in TEST()
189 EXPECT_EQ(Idx, I->second); in TEST()
193 for (unsigned Idx = 1, Size = all_one_int.size(); Idx < Size; ++Idx) { in TEST() local
194 hash_code code = hash_combine_range(&all_one_int[0], &all_one_int[0] + Idx); in TEST()
[all …]
/external/llvm/include/llvm/Support/
DArrayRecycler.h45 T *pop(unsigned Idx) { in pop() argument
46 if (Idx >= Bucket.size()) in pop()
48 FreeList *Entry = Bucket[Idx]; in pop()
51 Bucket[Idx] = Entry->Next; in pop()
56 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/AArch64/
DAArch64A57FPLoadBalancing.cpp143 void scanInstruction(MachineInstr *MI, unsigned Idx,
146 void maybeKillChain(MachineOperand &MO, unsigned Idx,
204 Chain(MachineInstr *MI, unsigned Idx, Color C) in Chain() argument
206 StartInstIdx(Idx), LastInstIdx(Idx), KillInstIdx(0), in Chain()
213 void add(MachineInstr *MI, unsigned Idx, Color C) { in add() argument
215 LastInstIdx = Idx; in add()
234 void setKill(MachineInstr *MI, unsigned Idx, bool Immutable) { in setKill() argument
236 KillInstIdx = Idx; in setKill()
340 unsigned Idx = 0; in runOnBasicBlock() local
342 scanInstruction(&MI, Idx++, ActiveChains, AllChains); in runOnBasicBlock()
[all …]
DAArch64ExpandPseudoInsts.cpp158 for (unsigned Idx = 0; Idx < 4; ++Idx) in tryToreplicateChunks() local
159 ++Counts[getChunk(UImm, Idx)]; in tryToreplicateChunks()
257 static uint64_t updateImm(uint64_t Imm, unsigned Idx, bool Clear) { in updateImm() argument
262 Imm &= ~(Mask << (Idx * 16)); in updateImm()
265 Imm |= Mask << (Idx * 16); in updateImm()
294 for (int Idx = 0; Idx < 4; ++Idx) { in trySequenceOfOnes() local
295 int64_t Chunk = getChunk(UImm, Idx); in trySequenceOfOnes()
300 StartIdx = Idx; in trySequenceOfOnes()
302 EndIdx = Idx; in trySequenceOfOnes()
328 for (int Idx = 0; Idx < 4; ++Idx) { in trySequenceOfOnes() local
[all …]
/external/llvm/lib/ExecutionEngine/OProfileJIT/
DOProfileWrapper.cpp143 ssize_t Idx = 0; in checkForOProfileProcEntry() local
150 while (Idx < NumRead-1 && ExeName[Idx] != 0) { in checkForOProfileProcEntry()
151 Idx++; in checkForOProfileProcEntry()
155 Idx--; in checkForOProfileProcEntry()
158 while (Idx > 0) { in checkForOProfileProcEntry()
159 if (ExeName[Idx] == '/') { in checkForOProfileProcEntry()
160 BaseName = ExeName + Idx + 1; in checkForOProfileProcEntry()
163 Idx--; in checkForOProfileProcEntry()
/external/libcxx/test/std/experimental/utilities/tuple/tuple.apply/
Dlarge_arity.pass.cpp34 template <class Tuple, class Idx>
37 template <class Tp, std::size_t ...Idx>
38 struct make_function<Tp, std::integer_sequence<std::size_t, Idx...>>
40 using type = bool (*)(always_t<Tp, Idx>...);
47 template <class Tp, class Idx>
51 template <class Tp, std::size_t ...Idx>
52 struct make_tuple_imp<Tp, std::integer_sequence<std::size_t, Idx...>>
54 using type = std::tuple<always_t<Tp, Idx>...>;

12345678910>>...16