| /external/clang/lib/Serialization/ |
| ASTReaderStmt.cpp | 35 unsigned &Idx;
83 const ASTReader::RecordData &Record, unsigned &Idx)
84 : Reader(Reader), F(F), DeclsCursor(Cursor), Record(Record), Idx(Idx) { }
111 SourceLocation TemplateKWLoc = ReadSourceLocation(Record, Idx);
113 ArgInfo.setLAngleLoc(ReadSourceLocation(Record, Idx));
114 ArgInfo.setRAngleLoc(ReadSourceLocation(Record, Idx));
117 Reader.ReadTemplateArgumentLoc(F, Record, Idx));
122 assert(Idx == NumStmtFields && "Incorrect statement field count");
127 S->setSemiLoc(ReadSourceLocation(Record, Idx));
[all...] |
| ASTReaderDecl.cpp | 45 unsigned &Idx;
72 for (unsigned I = 0, Size = Record[Idx++]; I != Size; ++I)
73 IDs.push_back(ReadDeclID(Record, Idx));
199 unsigned RawLocation, const RecordData &Record, unsigned &Idx)
201 RawLocation(RawLocation), Record(Record), Idx(Idx),
431 GetTypeSourceInfo(Record, Idx);
434 DD->DeclInfo = GetTypeSourceInfo(Record, Idx);
455 if (Record[Idx++]) {
457 CD->NumCtorInitializers = Record[Idx++]
[all...] |
| ASTReader.cpp | [all...] |
| /external/llvm/lib/Target/NVPTX/ |
| NVPTXMachineFunctionInfo.h | 44 const char *getImageHandleSymbol(unsigned Idx) const {
45 assert(ImageHandleList.size() > Idx && "Bad index");
46 return ImageHandleList[Idx].c_str();
|
| /external/llvm/include/llvm/ADT/ |
| PackedVector.h | 30 static T getValue(const BitVectorTy &Bits, unsigned Idx) {
33 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i));
37 static void setValue(BitVectorTy &Bits, unsigned Idx, T val) {
40 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i);
47 static T getValue(const BitVectorTy &Bits, unsigned Idx) {
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) {
59 Bits.set((Idx << (BitNum-1)) + BitNum-1);
63 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i)
[all...] |
| SparseMultiSet.h | 164 unsigned Idx = FreelistIdx;
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) {
176 Dense[Idx].Prev = SMSNode::INVALID;
177 Dense[Idx].Next = FreelistIdx;
178 FreelistIdx = Idx;
222 unsigned Idx;
[all...] |
| /external/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 43 // Remove an entry from the free list in Bucket[Idx] and return it.
45 T *pop(unsigned Idx) {
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) {
59 if (Idx >= Bucket.size())
60 Bucket.resize(size_t(Idx) + 1);
61 Entry->Next = Bucket[Idx];
[all...] |
| /external/llvm/lib/MC/ |
| MCRegisterInfo.cpp | 26 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 && Idx < getNumSubRegIndices() &
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| RegisterClassInfo.h | 134 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/llvm/utils/TableGen/ |
| CodeGenSchedule.h | 61 CodeGenSchedRW(unsigned Idx, Record *Def)
62 : Index(Idx), TheDef(Def), IsAlias(false), IsVariadic(false) {
75 CodeGenSchedRW(unsigned Idx, bool Read, ArrayRef<unsigned> Seq,
77 : Index(Idx), Name(Name), TheDef(nullptr), IsRead(Read), IsAlias(false),
174 // ItinDefList orders this processor's InstrItinData records by SchedClass idx.
200 CodeGenProcModel(unsigned Idx, const std::string &Name, Record *MDef,
202 Index(Idx), ModelName(Name), ModelDef(MDef), ItinsDef(IDef) {}
308 const CodeGenSchedRW &getSchedWrite(unsigned Idx) const {
309 assert(Idx < SchedWrites.size() && "bad SchedWrite index");
310 assert(SchedWrites[Idx].isValid() && "invalid SchedWrite")
[all...] |
| /external/llvm/lib/Fuzzer/ |
| FuzzerMutate.cpp | 83 size_t Idx = Rand(Size);
84 // Erase Data[Idx].
85 memmove(Data + Idx, Data + Idx + 1, Size - Idx - 1);
92 size_t Idx = Rand(Size + 1);
93 // Insert new value at Data[Idx].
94 memmove(Data + Idx + 1, Data + Idx, Size - Idx);
[all...] |
| /external/llvm/lib/CodeGen/ |
| MachineDominators.cpp | 74 size_t Idx = 0;
105 IsNewIDom[Idx] = false;
109 ++Idx;
113 Idx = 0;
121 if (IsNewIDom[Idx])
123 ++Idx;
|
| SplitKit.cpp | 295 bool SplitAnalysis::isOriginalEndpoint(SlotIndex Idx) const {
299 LiveInterval::const_iterator I = Orig.find(Idx);
301 // Range containing Idx should begin at Idx.
302 if (I != Orig.end() && I->start <= Idx)
303 return I->start == Idx;
305 // Range does not contain Idx, previous must end at Idx.
306 return I != Orig.begin() && (--I)->end == Idx;
364 SlotIndex Idx) {
[all...] |
| /external/llvm/lib/Target/AVR/ |
| AVRMachineFunctionInfo.h | 68 void setVarArgsFrameIndex(int Idx) { VarArgsFrameIndex = Idx; }
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/mach-o/ |
| sections-2.d | 6 Idx Name.*
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/pe/ |
| section-exclude.d | 9 Idx Name *Size *VMA *LMA *File off *Algn
|
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-d10v/ |
| default_layout.d | 8 Idx Name Size VMA LMA File off Algn
|
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| ArrayBoundChecker.cpp | 48 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);
|
| ReturnPointerRangeChecker.cpp | 50 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/include/llvm/ExecutionEngine/Orc/ |
| OrcTargetSupport.h | 73 void* getStub(unsigned Idx) const {
74 return static_cast<uint64_t*>(StubsMem.base()) + Idx;
79 void** getPtr(unsigned Idx) const {
82 return reinterpret_cast<void**>(PtrsBase) + Idx;
|
| /external/llvm/unittests/ADT/ |
| SCCIteratorTest.cpp | 27 static void ValidateIndex(unsigned Idx) {
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/llvm/lib/ExecutionEngine/OProfileJIT/ |
| OProfileWrapper.cpp | 143 ssize_t Idx = 0;
150 while (Idx < NumRead-1 && ExeName[Idx] != 0) {
151 Idx++;
155 Idx--;
158 while (Idx > 0) {
159 if (ExeName[Idx] == '/') {
160 BaseName = ExeName + Idx + 1;
163 Idx--;
|
| /external/llvm/lib/Target/SystemZ/ |
| SystemZTargetTransformInfo.cpp | 66 int SystemZTTIImpl::getIntImmCost(unsigned Opcode, unsigned Idx,
86 if (Idx == 0)
90 if (Idx == 0 && Imm.getBitWidth() <= 64) {
100 if (Idx == 1 && Imm.getBitWidth() <= 64) {
111 if (Idx == 1 && Imm.getBitWidth() <= 64) {
121 if (Idx == 1 && Imm.getBitWidth() <= 64) {
129 if (Idx == 1 && Imm.getBitWidth() <= 64) {
139 if (Idx == 1 && Imm.getBitWidth() <= 64) {
160 if (Idx == 1)
184 int SystemZTTIImpl::getIntImmCost(Intrinsic::ID IID, unsigned Idx,
[all...] |
| /external/llvm/lib/Target/PowerPC/ |
| PPCMachineFunctionInfo.h | 131 void setFramePointerSaveIndex(int Idx) { FramePointerSaveIndex = Idx; }
134 void setReturnAddrSaveIndex(int idx) { ReturnAddrSaveIndex = idx; }
137 void setBasePointerSaveIndex(int Idx) { BasePointerSaveIndex = Idx; }
140 void setPICBasePointerSaveIndex(int Idx) { PICBasePointerSaveIndex = Idx; }
190 void setCRSpillFrameIndex(int idx) { CRSpillFrameIndex = idx; }
[all...] |
| /external/libcxx/test/std/experimental/utilities/tuple/tuple.apply/ |
| large_arity.pass.cpp | 34 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>...>;
|
