/external/clang/lib/Serialization/ |
D | ASTReaderStmt.cpp | 35 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() 112 SourceLocation TemplateKWLoc = ReadSourceLocation(Record, Idx); in ReadTemplateKWAndArgsInfo() 114 ArgInfo.setLAngleLoc(ReadSourceLocation(Record, Idx)); in ReadTemplateKWAndArgsInfo() 115 ArgInfo.setRAngleLoc(ReadSourceLocation(Record, Idx)); in ReadTemplateKWAndArgsInfo() 118 Reader.ReadTemplateArgumentLoc(F, Record, Idx)); in ReadTemplateKWAndArgsInfo() 123 assert(Idx == NumStmtFields && "Incorrect statement field count"); in VisitStmt() 128 S->setSemiLoc(ReadSourceLocation(Record, Idx)); in VisitNullStmt() 129 S->HasLeadingEmptyMacro = Record[Idx++]; in VisitNullStmt() [all …]
|
D | ASTReaderDecl.cpp | 45 unsigned &Idx; member in clang::ASTDeclReader 92 for (unsigned I = 0, Size = Record[Idx++]; I != Size; ++I) in ReadDeclIDList() 93 IDs.push_back(ReadDeclID(Record, Idx)); in ReadDeclIDList() 220 const RecordData &Record, unsigned &Idx) in ASTDeclReader() argument 222 ThisDeclLoc(ThisDeclLoc), Record(Record), Idx(Idx), in ASTDeclReader() 463 GetTypeSourceInfo(Record, Idx); in Visit() 466 DD->DeclInfo = GetTypeSourceInfo(Record, Idx); in Visit() 487 if (Record[Idx++]) { in Visit() 489 CD->NumCtorInitializers = Record[Idx++]; in Visit() 491 CD->CtorInitializers = ReadGlobalOffset(F, Record, Idx); in Visit() [all …]
|
D | ASTReader.cpp | 1073 unsigned Idx = 0; in ParseLineTable() local 1078 for (unsigned I = 0; Record[Idx]; ++I) { in ParseLineTable() 1080 auto Filename = ReadPath(F, Record, Idx); in ParseLineTable() 1083 ++Idx; in ParseLineTable() 1087 while (Idx < Record.size()) { in ParseLineTable() 1088 int FID = Record[Idx++]; in ParseLineTable() 1094 unsigned NumEntries = Record[Idx++]; in ParseLineTable() 1099 unsigned FileOffset = Record[Idx++]; in ParseLineTable() 1100 unsigned LineNo = Record[Idx++]; in ParseLineTable() 1101 int FilenameID = FileIDs[Record[Idx++]]; in ParseLineTable() [all …]
|
/external/swiftshader/third_party/LLVM/lib/VMCore/ |
D | DebugLoc.cpp | 193 int &Idx = ScopeRecordIdx[Scope]; in getOrAddScopeRecordIdxEntry() local 194 if (Idx) return Idx; in getOrAddScopeRecordIdxEntry() 198 return Idx = ExistingIdx; in getOrAddScopeRecordIdxEntry() 208 Idx = ScopeRecords.size()+1; in getOrAddScopeRecordIdxEntry() 209 ScopeRecords.push_back(DebugRecVH(Scope, this, Idx)); in getOrAddScopeRecordIdxEntry() 210 return Idx; in getOrAddScopeRecordIdxEntry() 216 int &Idx = ScopeInlinedAtIdx[std::make_pair(Scope, IA)]; in getOrAddScopeInlinedAtIdxEntry() local 217 if (Idx) return Idx; in getOrAddScopeInlinedAtIdxEntry() 221 return Idx = ExistingIdx; in getOrAddScopeInlinedAtIdxEntry() 229 Idx = -ScopeInlinedAtRecords.size()-1; in getOrAddScopeInlinedAtIdxEntry() [all …]
|
/external/llvm/include/llvm/ADT/ |
D | SparseMultiSet.h | 164 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 …]
|
D | PackedVector.h | 30 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 …]
|
/external/llvm/lib/Target/Hexagon/ |
D | HexagonBlockRanges.h | 56 IndexType(unsigned Idx) : Index(Idx) {} in IndexType() 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) const; 124 IndexType getPrevIndex(IndexType Idx) const; [all …]
|
D | HexagonBlockRanges.cpp | 162 IndexType Idx = IndexType::First; in InstrIndexMap() local 163 First = Idx; in InstrIndexMap() 168 Map.insert(std::make_pair(Idx, &In)); in InstrIndexMap() 169 ++Idx; in InstrIndexMap() 171 Last = B.empty() ? IndexType::None : unsigned(Idx)-1; in InstrIndexMap() 175 MachineInstr *HexagonBlockRanges::InstrIndexMap::getInstr(IndexType Idx) const { in getInstr() 176 auto F = Map.find(Idx); in getInstr() 191 IndexType Idx) const { in getPrevIndex() 192 assert (Idx != IndexType::None); in getPrevIndex() 193 if (Idx == IndexType::Entry) in getPrevIndex() [all …]
|
/external/compiler-rt/test/asan/TestCases/Linux/ |
D | scariness_score_test.cc | 50 void HeapBuferOverflow(int Idx, ReadOrWrite w) { in HeapBuferOverflow() argument 54 t[100 + Idx] = T(); in HeapBuferOverflow() 56 sink = t[100 + Idx]; in HeapBuferOverflow() 61 void HeapUseAfterFree(int Idx, ReadOrWrite w) { in HeapUseAfterFree() argument 67 t[Idx] = T(); in HeapUseAfterFree() 69 sink = t[Idx]; in HeapUseAfterFree() 73 void StackBufferOverflow(int Idx, ReadOrWrite w) { in StackBufferOverflow() argument 76 sink = t[Idx]; in StackBufferOverflow() 78 t[100 + Idx] = T(); in StackBufferOverflow() 80 sink = t[100 + Idx]; in StackBufferOverflow() [all …]
|
/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
D | PackedVector.h | 30 static T getValue(const llvm::BitVector &Bits, unsigned Idx) { in getValue() argument 33 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i)); in getValue() 37 static void setValue(llvm::BitVector &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 llvm::BitVector &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(llvm::BitVector &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 …]
|
D | BitVector.h | 46 reference(BitVector &b, unsigned Idx) { in reference() argument 47 WordRef = &b.Bits[Idx / BITWORD_SIZE]; in reference() 48 BitPos = Idx % BITWORD_SIZE; in reference() 230 BitVector &set(unsigned Idx) { in set() argument 231 Bits[Idx / BITWORD_SIZE] |= 1L << (Idx % BITWORD_SIZE); in set() 240 BitVector &reset(unsigned Idx) { in reset() argument 241 Bits[Idx / BITWORD_SIZE] &= ~(1L << (Idx % BITWORD_SIZE)); in reset() 252 BitVector &flip(unsigned Idx) { in flip() argument 253 Bits[Idx / BITWORD_SIZE] ^= 1L << (Idx % BITWORD_SIZE); in flip() 263 reference operator[](unsigned Idx) { [all …]
|
D | SmallBitVector.h | 62 reference(SmallBitVector &b, unsigned Idx) : TheVector(b), BitPos(Idx) {} in reference() argument 288 SmallBitVector &set(unsigned Idx) { in set() argument 290 setSmallBits(getSmallBits() | (uintptr_t(1) << Idx)); in set() 292 getPointer()->set(Idx); in set() 304 SmallBitVector &reset(unsigned Idx) { in reset() argument 306 setSmallBits(getSmallBits() & ~(uintptr_t(1) << Idx)); in reset() 308 getPointer()->reset(Idx); in reset() 320 SmallBitVector &flip(unsigned Idx) { in flip() argument 322 setSmallBits(getSmallBits() ^ (uintptr_t(1) << Idx)); in flip() 324 getPointer()->flip(Idx); in flip() [all …]
|
/external/llvm/include/llvm/Transforms/IPO/ |
D | DeadArgumentElimination.h | 40 RetOrArg(const Function *F, unsigned Idx, bool IsArg) in RetOrArg() 41 : F(F), Idx(Idx), IsArg(IsArg) {} in RetOrArg() 43 unsigned Idx; member 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) + in getDescription() 71 RetOrArg CreateRet(const Function *F, unsigned Idx) { in CreateRet() argument 72 return RetOrArg(F, Idx, false); in CreateRet() 75 RetOrArg CreateArg(const Function *F, unsigned Idx) { in CreateArg() argument 76 return RetOrArg(F, Idx, true); in CreateArg()
|
/external/swiftshader/third_party/LLVM/lib/Target/ARM/MCTargetDesc/ |
D | ARMMCTargetDesc.cpp | 42 unsigned Idx = 0; in ParseARMTriple() local 47 Idx = 4; in ParseARMTriple() 51 Idx = 6; in ParseARMTriple() 55 if (Idx) { in ParseARMTriple() 56 unsigned SubVer = TT[Idx]; in ParseARMTriple() 58 if (Len >= Idx+2 && TT[Idx+1] == 'm') { in ParseARMTriple() 61 } else if (Len >= Idx+3 && TT[Idx+1] == 'e'&& TT[Idx+2] == 'm') { in ParseARMTriple() 69 if (Len >= Idx+3 && TT[Idx+1] == 't' && TT[Idx+2] == '2') in ParseARMTriple() 71 else if (Len >= Idx+2 && TT[Idx+1] == 'm') in ParseARMTriple() 77 if (Len >= Idx+3 && TT[Idx+1] == 't' && TT[Idx+2] == 'e') in ParseARMTriple() [all …]
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
D | SplitKit.cpp | 276 bool SplitAnalysis::isOriginalEndpoint(SlotIndex Idx) const { in isOriginalEndpoint() 280 LiveInterval::const_iterator I = Orig.find(Idx); in isOriginalEndpoint() 283 if (I != Orig.end() && I->start <= Idx) in isOriginalEndpoint() 284 return I->start == Idx; in isOriginalEndpoint() 287 return I != Orig.begin() && (--I)->end == Idx; in isOriginalEndpoint() 347 SlotIndex Idx) { in defValue() argument 349 assert(Idx.isValid() && "Invalid SlotIndex"); in defValue() 350 assert(Edit->getParent().getVNInfoAt(Idx) == ParentVNI && "Bad Parent VNI"); in defValue() 354 VNInfo *VNI = LI->getNextValue(Idx, 0, LIS.getVNInfoAllocator()); in defValue() 446 void SplitEditor::selectIntv(unsigned Idx) { in selectIntv() argument [all …]
|
/external/llvm/lib/Fuzzer/ |
D | FuzzerMutate.cpp | 79 size_t Idx = Rand(Corpus->size()); in Mutate_CustomCrossOver() local 80 const Unit &Other = (*Corpus)[Idx]; in Mutate_CustomCrossOver() 110 size_t Idx = Rand(Size); in Mutate_EraseByte() local 112 memmove(Data + Idx, Data + Idx + 1, Size - Idx - 1); in Mutate_EraseByte() 119 size_t Idx = Rand(Size + 1); in Mutate_InsertByte() local 121 memmove(Data + Idx + 1, Data + Idx, Size - Idx); in Mutate_InsertByte() 122 Data[Idx] = RandCh(Rand); in Mutate_InsertByte() 128 size_t Idx = Rand(Size); in Mutate_ChangeByte() local 129 Data[Idx] = RandCh(Rand); in Mutate_ChangeByte() 135 size_t Idx = Rand(Size); in Mutate_ChangeBit() local [all …]
|
/external/llvm/lib/CodeGen/ |
D | SplitKit.cpp | 315 bool SplitAnalysis::isOriginalEndpoint(SlotIndex Idx) const { in isOriginalEndpoint() 319 LiveInterval::const_iterator I = Orig.find(Idx); in isOriginalEndpoint() 322 if (I != Orig.end() && I->start <= Idx) in isOriginalEndpoint() 323 return I->start == Idx; in isOriginalEndpoint() 326 return I != Orig.begin() && (--I)->end == Idx; in isOriginalEndpoint() 386 SlotIndex Idx) { in defValue() argument 388 assert(Idx.isValid() && "Invalid SlotIndex"); in defValue() 389 assert(Edit->getParent().getVNInfoAt(Idx) == ParentVNI && "Bad Parent VNI"); in defValue() 393 VNInfo *VNI = LI->getNextValue(Idx, LIS.getVNInfoAllocator()); in defValue() 490 void SplitEditor::selectIntv(unsigned Idx) { in selectIntv() argument [all …]
|
/external/llvm/utils/TableGen/ |
D | CodeGenSchedule.h | 61 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() 204 CodeGenProcModel(unsigned Idx, const std::string &Name, Record *MDef, in CodeGenProcModel() 206 Index(Idx), ModelName(Name), ModelDef(MDef), ItinsDef(IDef) {} in CodeGenProcModel() 318 const CodeGenSchedRW &getSchedWrite(unsigned Idx) const { in getSchedWrite() argument 319 assert(Idx < SchedWrites.size() && "bad SchedWrite index"); in getSchedWrite() 320 assert(SchedWrites[Idx].isValid() && "invalid SchedWrite"); in getSchedWrite() 321 return SchedWrites[Idx]; in getSchedWrite() [all …]
|
/external/llvm/lib/MC/ |
D | MCRegisterInfo.cpp | 26 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/ |
D | SystemZTargetTransformInfo.cpp | 66 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/swiftshader/third_party/LLVM/include/llvm/ |
D | Attributes.h | 170 static AttributeWithIndex get(unsigned Idx, Attributes Attrs) { in get() 172 P.Index = Idx; in get() 214 AttrListPtr addAttr(unsigned Idx, Attributes Attrs) const; 219 AttrListPtr removeAttr(unsigned Idx, Attributes Attrs) const; 226 Attributes getParamAttributes(unsigned Idx) const { in getParamAttributes() argument 227 assert (Idx && Idx != ~0U && "Invalid parameter index!"); in getParamAttributes() 228 return getAttributes(Idx); in getParamAttributes() 244 bool paramHasAttr(unsigned Idx, Attributes Attr) const { in paramHasAttr() argument 245 return (getAttributes(Idx) & Attr) != 0; in paramHasAttr() 250 unsigned getParamAlignment(unsigned Idx) const { in getParamAlignment() argument [all …]
|
/external/llvm/unittests/ADT/ |
D | SCCIteratorTest.cpp | 27 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 …]
|
D | HashingTest.cpp | 177 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/swiftshader/third_party/LLVM/unittests/ADT/ |
D | SCCIteratorTest.cpp | 27 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 …]
|
/external/llvm/include/llvm/Support/ |
D | ArrayRecycler.h | 45 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()
|