| /external/llvm/lib/Target/Hexagon/ |
| HexagonBlockRanges.h | 56 IndexType(unsigned Idx) : Index(Idx) {}
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
[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...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 42 // Remove an entry from the free list in Bucket[Idx] and return it.
44 T *pop(unsigned Idx) {
45 if (Idx >= Bucket.size())
47 FreeList *Entry = Bucket[Idx];
50 Bucket[Idx] = Entry->Next;
54 // Add an entry to the free list at Bucket[Idx].
55 void push(unsigned Idx, T *Ptr) {
58 if (Idx >= Bucket.size())
59 Bucket.resize(size_t(Idx) + 1);
60 Entry->Next = Bucket[Idx];
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 42 // Remove an entry from the free list in Bucket[Idx] and return it.
44 T *pop(unsigned Idx) {
45 if (Idx >= Bucket.size())
47 FreeList *Entry = Bucket[Idx];
50 Bucket[Idx] = Entry->Next;
54 // Add an entry to the free list at Bucket[Idx].
55 void push(unsigned Idx, T *Ptr) {
58 if (Idx >= Bucket.size())
59 Bucket.resize(size_t(Idx) + 1);
60 Entry->Next = Bucket[Idx];
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 42 // Remove an entry from the free list in Bucket[Idx] and return it.
44 T *pop(unsigned Idx) {
45 if (Idx >= Bucket.size())
47 FreeList *Entry = Bucket[Idx];
50 Bucket[Idx] = Entry->Next;
54 // Add an entry to the free list at Bucket[Idx].
55 void push(unsigned Idx, T *Ptr) {
58 if (Idx >= Bucket.size())
59 Bucket.resize(size_t(Idx) + 1);
60 Entry->Next = Bucket[Idx];
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 42 // Remove an entry from the free list in Bucket[Idx] and return it.
44 T *pop(unsigned Idx) {
45 if (Idx >= Bucket.size())
47 FreeList *Entry = Bucket[Idx];
50 Bucket[Idx] = Entry->Next;
54 // Add an entry to the free list at Bucket[Idx].
55 void push(unsigned Idx, T *Ptr) {
58 if (Idx >= Bucket.size())
59 Bucket.resize(size_t(Idx) + 1);
60 Entry->Next = Bucket[Idx];
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 42 // Remove an entry from the free list in Bucket[Idx] and return it.
44 T *pop(unsigned Idx) {
45 if (Idx >= Bucket.size())
47 FreeList *Entry = Bucket[Idx];
50 Bucket[Idx] = Entry->Next;
54 // Add an entry to the free list at Bucket[Idx].
55 void push(unsigned Idx, T *Ptr) {
58 if (Idx >= Bucket.size())
59 Bucket.resize(size_t(Idx) + 1);
60 Entry->Next = Bucket[Idx];
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 42 // Remove an entry from the free list in Bucket[Idx] and return it.
44 T *pop(unsigned Idx) {
45 if (Idx >= Bucket.size())
47 FreeList *Entry = Bucket[Idx];
50 Bucket[Idx] = Entry->Next;
54 // Add an entry to the free list at Bucket[Idx].
55 void push(unsigned Idx, T *Ptr) {
58 if (Idx >= Bucket.size())
59 Bucket.resize(size_t(Idx) + 1);
60 Entry->Next = Bucket[Idx];
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 42 // Remove an entry from the free list in Bucket[Idx] and return it.
44 T *pop(unsigned Idx) {
45 if (Idx >= Bucket.size())
47 FreeList *Entry = Bucket[Idx];
50 Bucket[Idx] = Entry->Next;
54 // Add an entry to the free list at Bucket[Idx].
55 void push(unsigned Idx, T *Ptr) {
58 if (Idx >= Bucket.size())
59 Bucket.resize(size_t(Idx) + 1);
60 Entry->Next = Bucket[Idx];
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 42 // Remove an entry from the free list in Bucket[Idx] and return it.
44 T *pop(unsigned Idx) {
45 if (Idx >= Bucket.size())
47 FreeList *Entry = Bucket[Idx];
50 Bucket[Idx] = Entry->Next;
54 // Add an entry to the free list at Bucket[Idx].
55 void push(unsigned Idx, T *Ptr) {
58 if (Idx >= Bucket.size())
59 Bucket.resize(size_t(Idx) + 1);
60 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/compiler-rt/lib/esan/ |
| esan_circular_buffer.h | 48 T &operator[](uptr Idx) {
49 CHECK_LT(Idx, Count);
50 uptr ArrayIdx = (StartIdx + Idx) % Capacity;
53 const T &operator[](uptr Idx) const {
54 CHECK_LT(Idx, Count);
55 uptr ArrayIdx = (StartIdx + Idx) % Capacity;
|
| /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;
|
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/CodeGen/ |
| RegisterClassInfo.h | 138 unsigned getRegPressureSetLimit(unsigned Idx) const {
139 if (!PSetLimits[Idx])
140 PSetLimits[Idx] = computePSetLimit(Idx);
141 return PSetLimits[Idx];
145 unsigned computePSetLimit(unsigned Idx) const;
|
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/ |
| RegisterClassInfo.h | 138 unsigned getRegPressureSetLimit(unsigned Idx) const {
139 if (!PSetLimits[Idx])
140 PSetLimits[Idx] = computePSetLimit(Idx);
141 return PSetLimits[Idx];
145 unsigned computePSetLimit(unsigned Idx) const;
|
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/ |
| RegisterClassInfo.h | 138 unsigned getRegPressureSetLimit(unsigned Idx) const {
139 if (!PSetLimits[Idx])
140 PSetLimits[Idx] = computePSetLimit(Idx);
141 return PSetLimits[Idx];
145 unsigned computePSetLimit(unsigned Idx) const;
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
| RegisterClassInfo.h | 138 unsigned getRegPressureSetLimit(unsigned Idx) const {
139 if (!PSetLimits[Idx])
140 PSetLimits[Idx] = computePSetLimit(Idx);
141 return PSetLimits[Idx];
145 unsigned computePSetLimit(unsigned Idx) const;
|
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/CodeGen/ |
| RegisterClassInfo.h | 138 unsigned getRegPressureSetLimit(unsigned Idx) const {
139 if (!PSetLimits[Idx])
140 PSetLimits[Idx] = computePSetLimit(Idx);
141 return PSetLimits[Idx];
145 unsigned computePSetLimit(unsigned Idx) const;
|
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/CodeGen/ |
| RegisterClassInfo.h | 138 unsigned getRegPressureSetLimit(unsigned Idx) const {
139 if (!PSetLimits[Idx])
140 PSetLimits[Idx] = computePSetLimit(Idx);
141 return PSetLimits[Idx];
145 unsigned computePSetLimit(unsigned Idx) const;
|
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/CodeGen/ |
| RegisterClassInfo.h | 138 unsigned getRegPressureSetLimit(unsigned Idx) const {
139 if (!PSetLimits[Idx])
140 PSetLimits[Idx] = computePSetLimit(Idx);
141 return PSetLimits[Idx];
145 unsigned computePSetLimit(unsigned Idx) const;
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
| RegisterClassInfo.h | 138 unsigned getRegPressureSetLimit(unsigned Idx) const {
139 if (!PSetLimits[Idx])
140 PSetLimits[Idx] = computePSetLimit(Idx);
141 return PSetLimits[Idx];
145 unsigned computePSetLimit(unsigned Idx) const;
|
| /external/clang/lib/Serialization/ |
| ASTReaderDecl.cpp | 45 unsigned &Idx;
92 for (unsigned I = 0, Size = Record[Idx++]; I != Size; ++I)
93 IDs.push_back(ReadDeclID(Record, Idx));
220 const RecordData &Record, unsigned &Idx)
222 ThisDeclLoc(ThisDeclLoc), Record(Record), Idx(Idx),
463 GetTypeSourceInfo(Record, Idx);
466 DD->DeclInfo = GetTypeSourceInfo(Record, Idx);
487 if (Record[Idx++]) {
489 CD->NumCtorInitializers = Record[Idx++]
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3859424/prebuilt_include/llvm/lib/Fuzzer/ |
| FuzzerCorpus.h | 61 const Unit &operator[] (size_t Idx) const { return Inputs[Idx]->U; }
91 size_t Idx = static_cast<size_t>(CorpusDistribution(Rand.Get_mt19937()));
92 assert(Idx < Inputs.size());
93 return Idx;
117 void DeleteInput(size_t Idx) {
118 InputInfo &II = *Inputs[Idx];
123 Printf("EVICTED %zd\n", Idx);
126 bool AddFeature(size_t Idx, uint32_t NewSize, bool Shrink) {
128 Idx = Idx % kFeatureSetSize
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/lib/Fuzzer/ |
| FuzzerCorpus.h | 70 const Unit &operator[] (size_t Idx) const { return Inputs[Idx]->U; }
101 size_t Idx = static_cast<size_t>(CorpusDistribution(Rand));
102 assert(Idx < Inputs.size());
103 return Idx;
127 void DeleteInput(size_t Idx) {
128 InputInfo &II = *Inputs[Idx];
133 Printf("EVICTED %zd\n", Idx);
136 void AddFeature(size_t Idx, uint32_t NewSize, bool Shrink) {
138 Idx = Idx % kFeatureSetSize
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/lib/Fuzzer/ |
| FuzzerCorpus.h | 70 const Unit &operator[] (size_t Idx) const { return Inputs[Idx]->U; }
101 size_t Idx = static_cast<size_t>(CorpusDistribution(Rand));
102 assert(Idx < Inputs.size());
103 return Idx;
127 void DeleteInput(size_t Idx) {
128 InputInfo &II = *Inputs[Idx];
133 Printf("EVICTED %zd\n", Idx);
136 void AddFeature(size_t Idx, uint32_t NewSize, bool Shrink) {
138 Idx = Idx % kFeatureSetSize
[all...] |
