/external/clang/lib/Serialization/ |
D | ASTReaderStmt.cpp | 33 unsigned &Idx; member in clang::ASTStmtReader 73 const ASTReader::RecordData &Record, unsigned &Idx) in ASTStmtReader() argument 74 : Reader(Reader), F(F), DeclsCursor(Cursor), Record(Record), Idx(Idx) { } in ASTStmtReader() 101 SourceLocation TemplateKWLoc = ReadSourceLocation(Record, Idx); in ReadTemplateKWAndArgsInfo() 103 ArgInfo.setLAngleLoc(ReadSourceLocation(Record, Idx)); in ReadTemplateKWAndArgsInfo() 104 ArgInfo.setRAngleLoc(ReadSourceLocation(Record, Idx)); in ReadTemplateKWAndArgsInfo() 107 Reader.ReadTemplateArgumentLoc(F, Record, Idx)); in ReadTemplateKWAndArgsInfo() 112 assert(Idx == NumStmtFields && "Incorrect statement field count"); in VisitStmt() 117 S->setSemiLoc(ReadSourceLocation(Record, Idx)); in VisitNullStmt() 118 S->HasLeadingEmptyMacro = Record[Idx++]; in VisitNullStmt() [all …]
|
D | ASTReaderDecl.cpp | 44 unsigned &Idx; member in clang::ASTDeclReader 193 const RecordData &Record, unsigned &Idx) in ASTDeclReader() argument 195 RawLocation(RawLocation), Record(Record), Idx(Idx), in ASTDeclReader() 307 GetTypeSourceInfo(Record, Idx); in Visit() 310 DD->DeclInfo = GetTypeSourceInfo(Record, Idx); in Visit() 326 if (Record[Idx++]) { in Visit() 339 GlobalDeclID SemaDCIDForTemplateParmDecl = ReadDeclID(Record, Idx); in VisitDecl() 340 GlobalDeclID LexicalDCIDForTemplateParmDecl = ReadDeclID(Record, Idx); in VisitDecl() 346 DeclContext *SemaDC = ReadDeclAs<DeclContext>(Record, Idx); in VisitDecl() 347 DeclContext *LexicalDC = ReadDeclAs<DeclContext>(Record, Idx); in VisitDecl() [all …]
|
D | ASTReader.cpp | 756 unsigned Idx = 0; in ParseLineTable() local 761 for (int I = 0, N = Record[Idx++]; I != N; ++I) { in ParseLineTable() 763 unsigned FilenameLen = Record[Idx++]; in ParseLineTable() 764 std::string Filename(&Record[Idx], &Record[Idx] + FilenameLen); in ParseLineTable() 765 Idx += FilenameLen; in ParseLineTable() 772 while (Idx < Record.size()) { in ParseLineTable() 773 int FID = Record[Idx++]; in ParseLineTable() 779 unsigned NumEntries = Record[Idx++]; in ParseLineTable() 784 unsigned FileOffset = Record[Idx++]; in ParseLineTable() 785 unsigned LineNo = Record[Idx++]; in ParseLineTable() [all …]
|
/external/llvm/lib/IR/ |
D | DebugLoc.cpp | 164 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 …]
|
D | Attributes.cpp | 595 AttributeSet AttributeSet::get(LLVMContext &C, unsigned Idx, AttrBuilder &B) { in get() argument 607 Attrs.push_back(std::make_pair(Idx, Attribute:: in get() 610 Attrs.push_back(std::make_pair(Idx, Attribute:: in get() 613 Attrs.push_back(std::make_pair(Idx, Attribute::get(C, Kind))); in get() 619 Attrs.push_back(std::make_pair(Idx, Attribute::get(C, I->first,I->second))); in get() 624 AttributeSet AttributeSet::get(LLVMContext &C, unsigned Idx, in get() argument 629 Attrs.push_back(std::make_pair(Idx, Attribute::get(C, *I))); in get() 646 AttributeSet AttributeSet::addAttribute(LLVMContext &C, unsigned Idx, in addAttribute() argument 648 if (hasAttribute(Idx, Attr)) return *this; in addAttribute() 649 return addAttributes(C, Idx, AttributeSet::get(C, Idx, Attr)); in addAttribute() [all …]
|
/external/llvm/include/llvm/ADT/ |
D | SparseMultiSet.h | 160 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 …]
|
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 …]
|
D | SmallBitVector.h | 63 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 …]
|
D | SparseBitVector.h | 66 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 …]
|
D | BitVector.h | 47 reference(BitVector &b, unsigned Idx) { in reference() argument 48 WordRef = &b.Bits[Idx / BITWORD_SIZE]; in reference() 49 BitPos = Idx % BITWORD_SIZE; in reference() 235 BitVector &set(unsigned Idx) { in set() argument 236 Bits[Idx / BITWORD_SIZE] |= 1L << (Idx % BITWORD_SIZE); in set() 273 BitVector &reset(unsigned Idx) { in reset() argument 274 Bits[Idx / BITWORD_SIZE] &= ~(1L << (Idx % BITWORD_SIZE)); in reset() 313 BitVector &flip(unsigned Idx) { in flip() argument 314 Bits[Idx / BITWORD_SIZE] ^= 1L << (Idx % BITWORD_SIZE); in flip() 319 reference operator[](unsigned Idx) { [all …]
|
/external/llvm/lib/Target/ARM/MCTargetDesc/ |
D | ARMMCTargetDesc.cpp | 46 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() 63 if (Len >= Idx+2 && TT[Idx+1] == 'm') { in ParseARMTriple() 70 } else if (Len >= Idx+3 && TT[Idx+1] == 'e'&& TT[Idx+2] == 'm') { in ParseARMTriple() 78 } else if (Len >= Idx+2 && TT[Idx+1] == 's') { in ParseARMTriple() 99 if (Len >= Idx+3 && TT[Idx+1] == 't' && TT[Idx+2] == '2') in ParseARMTriple() 101 else if (Len >= Idx+2 && TT[Idx+1] == 'm') { in ParseARMTriple() [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, 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() 284 const CodeGenSchedRW &getSchedWrite(unsigned Idx) const { in getSchedWrite() argument 285 assert(Idx < SchedWrites.size() && "bad SchedWrite index"); in getSchedWrite() 286 assert(SchedWrites[Idx].isValid() && "invalid SchedWrite"); in getSchedWrite() 287 return SchedWrites[Idx]; in getSchedWrite() [all …]
|
/external/llvm/lib/CodeGen/ |
D | SplitKit.cpp | 299 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() 374 SlotIndex Idx) { in defValue() argument 376 assert(Idx.isValid() && "Invalid SlotIndex"); in defValue() 377 assert(Edit->getParent().getVNInfoAt(Idx) == ParentVNI && "Bad Parent VNI"); in defValue() 381 VNInfo *VNI = LI->getNextValue(Idx, LIS.getVNInfoAllocator()); in defValue() 471 void SplitEditor::selectIntv(unsigned Idx) { in selectIntv() argument [all …]
|
D | LiveDebugVariables.cpp | 128 void insertDebugValue(MachineBasicBlock *MBB, SlotIndex Idx, unsigned LocNo, 204 void addDef(SlotIndex Idx, const MachineOperand &LocMO) { in addDef() argument 206 LocMap::iterator I = locInts.find(Idx); in addDef() 207 if (!I.valid() || I.start() != Idx) in addDef() 208 I.insert(Idx, Idx.getNextSlot(), getLocationNo(LocMO)); in addDef() 225 void extendDef(SlotIndex Idx, unsigned LocNo, 311 bool handleDebugValue(MachineInstr *MI, SlotIndex Idx); 445 bool LDVImpl::handleDebugValue(MachineInstr *MI, SlotIndex Idx) { in handleDebugValue() argument 457 UV->addDef(Idx, MI->getOperand(0)); in handleDebugValue() 473 SlotIndex Idx = MBBI == MBB->begin() ? in collectDebugValues() local [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() 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 …]
|
D | HashingTest.cpp | 178 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/ |
D | AArch64MachineFunctionInfo.h | 128 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/ |
D | ArrayRecycler.h | 43 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/ |
D | X86TargetTransformInfo.cpp | 191 int Idx = CostTableLookup<MVT>(AVX1CostTable, array_lengthof(AVX1CostTable), in getArithmeticInstrCost() local 193 if (Idx != -1) in getArithmeticInstrCost() 194 return LT.first * AVX1CostTable[Idx].Cost; in getArithmeticInstrCost() 204 int Idx = CostTableLookup<MVT>(CustomLowered, array_lengthof(CustomLowered), in getArithmeticInstrCost() local 206 if (Idx != -1) in getArithmeticInstrCost() 207 return LT.first * CustomLowered[Idx].Cost; in getArithmeticInstrCost() 266 int Idx = ConvertCostTableLookup<MVT>(AVXConversionTbl, in getCastInstrCost() local 269 if (Idx != -1) in getCastInstrCost() 270 return AVXConversionTbl[Idx].Cost; in getCastInstrCost() 313 int Idx = CostTableLookup<MVT>(AVX2CostTbl, array_lengthof(AVX2CostTbl), ISD, MTy); in getCmpSelInstrCost() local [all …]
|
/external/llvm/lib/ExecutionEngine/OProfileJIT/ |
D | OProfileWrapper.cpp | 144 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/ |
D | LiveInterval.h | 311 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 …]
|
/external/clang/unittests/AST/ |
D | CommentParser.cpp | 94 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/ |
D | ThreadSanitizer.cpp | 373 int Idx = getMemoryAccessFuncIndex(Addr); in instrumentLoadOrStore() local 374 if (Idx < 0) in instrumentLoadOrStore() 389 Value *OnAccessFunc = IsWrite ? TsanWrite[Idx] : TsanRead[Idx]; in instrumentLoadOrStore() 438 int Idx = getMemoryAccessFuncIndex(Addr); in instrumentAtomic() local 439 if (Idx < 0) in instrumentAtomic() 441 const size_t ByteSize = 1 << Idx; in instrumentAtomic() 447 CallInst *C = CallInst::Create(TsanAtomicLoad[Idx], in instrumentAtomic() 453 int Idx = getMemoryAccessFuncIndex(Addr); in instrumentAtomic() local 454 if (Idx < 0) in instrumentAtomic() 456 const size_t ByteSize = 1 << Idx; in instrumentAtomic() [all …]
|
/external/llvm/include/llvm/IR/ |
D | Attributes.h | 212 AttributeSetNode *getAttributes(unsigned Idx) const; 236 static AttributeSet get(LLVMContext &C, unsigned Idx, 238 static AttributeSet get(LLVMContext &C, unsigned Idx, AttrBuilder &B); 242 AttributeSet addAttribute(LLVMContext &C, unsigned Idx, 247 AttributeSet addAttribute(LLVMContext &C, unsigned Idx, 252 AttributeSet addAttributes(LLVMContext &C, unsigned Idx, 258 AttributeSet removeAttribute(LLVMContext &C, unsigned Idx, 264 AttributeSet removeAttributes(LLVMContext &C, unsigned Idx, 275 AttributeSet getParamAttributes(unsigned Idx) const; 303 unsigned getParamAlignment(unsigned Idx) const; [all …]
|
/external/llvm/lib/Target/ARM/ |
D | ARMTargetTransformInfo.cpp | 191 int Idx = CostTableLookup<MVT>(NEONFltDblTbl, array_lengthof(NEONFltDblTbl), in getCastInstrCost() local 193 if (Idx != -1) in getCastInstrCost() 194 return LT.first * NEONFltDblTbl[Idx].Cost; in getCastInstrCost() 274 int Idx = ConvertCostTableLookup<MVT>(NEONVectorConversionTbl, in getCastInstrCost() local 277 if (Idx != -1) in getCastInstrCost() 278 return NEONVectorConversionTbl[Idx].Cost; in getCastInstrCost() 305 int Idx = ConvertCostTableLookup<MVT>(NEONFloatConversionTbl, in getCastInstrCost() local 309 if (Idx != -1) in getCastInstrCost() 310 return NEONFloatConversionTbl[Idx].Cost; in getCastInstrCost() 338 int Idx = ConvertCostTableLookup<MVT>(NEONIntegerConversionTbl, in getCastInstrCost() local [all …]
|