| /external/swiftshader/third_party/llvm-7.0/llvm/tools/llvm-c-test/ |
| attributes.c | 28 int Idx, ParamCount;
29 for (Idx = LLVMAttributeFunctionIndex, ParamCount = LLVMCountParams(F);
30 Idx <= ParamCount; ++Idx) {
31 int AttrCount = LLVMGetAttributeCountAtIndex(F, Idx);
35 LLVMGetAttributesAtIndex(F, Idx, Attrs);
59 int Idx, ParamCount;
60 for (Idx = LLVMAttributeFunctionIndex,
62 Idx <= ParamCount; ++Idx) {
[all...] |
| /device/linaro/bootloader/edk2/OvmfPkg/AcpiPlatformDxe/ |
| PciDecoding.c | 55 UINTN Idx;
90 for (Idx = 0; Idx < NoHandles; ++Idx) {
97 Status = gBS->HandleProtocol (Handles[Idx], &gEfiPciIoProtocolGuid,
100 OrigAttrs[Idx].PciIo = PciIo;
106 &OrigAttrs[Idx].PciAttributes);
146 while (Idx > 0) {
147 --Idx;
148 OrigAttrs[Idx].PciIo->Attributes (OrigAttrs[Idx].PciIo,
[all...] |
| /external/llvm/include/llvm/Transforms/IPO/ |
| DeadArgumentElimination.h | 40 RetOrArg(const Function *F, unsigned Idx, bool IsArg)
41 : F(F), Idx(Idx), IsArg(IsArg) {}
43 unsigned Idx;
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) +
71 RetOrArg CreateRet(const Function *F, unsigned Idx) {
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Transforms/IPO/ |
| DeadArgumentElimination.h | 47 unsigned Idx;
50 RetOrArg(const Function *F, unsigned Idx, bool IsArg)
51 : F(F), Idx(Idx), IsArg(IsArg) {}
55 return std::tie(F, Idx, IsArg) < std::tie(O.F, O.Idx, O.IsArg);
60 return F == O.F && Idx == O.Idx && IsArg == O.IsArg;
64 return (Twine(IsArg ? "Argument #" : "Return value #") + Twine(Idx) +
83 RetOrArg CreateRet(const Function *F, unsigned Idx) {
[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/swiftshader/third_party/llvm-7.0/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/compiler-rt/test/asan/TestCases/Linux/ |
| scariness_score_test.cc | 50 void HeapBuferOverflow(int Idx, ReadOrWrite w) {
54 t[100 + Idx] = T();
56 sink = t[100 + Idx];
61 void HeapUseAfterFree(int Idx, ReadOrWrite w) {
67 t[Idx] = T();
69 sink = t[Idx];
73 void StackBufferOverflow(int Idx, ReadOrWrite w) {
76 sink = t[Idx];
78 t[100 + Idx] = T();
80 sink = t[100 + Idx];
[all...] |
| /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Foundation/Library/Dxe/EfiDriverLib/ |
| Handle.c | 68 UINTN Idx;
93 Idx = 0;
96 // Leave the Idx just beyond the matching handle.
98 for (; Idx < NumberOfHandles;) {
99 if (*Handle == HandleBuffer[Idx++]) {
108 for (; Idx < NumberOfHandles; Idx++) {
136 *Handle = HandleBuffer[Idx];
144 HandleBuffer[Idx],
156 HandleBuffer[Idx],
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/DebugInfo/PDB/Native/ |
| HashTable.cpp | 40 for (unsigned Idx = 0; Idx < 32; ++Idx)
41 if (Word & (1U << Idx))
42 V.set((I * 32) + Idx);
59 uint32_t Idx = 0;
62 for (uint32_t WordIdx = 0; WordIdx < 32; ++WordIdx, ++Idx) {
63 if (Vec.test(Idx))
|
| /external/llvm/lib/Target/AMDGPU/ |
| AMDGPUIntrinsicInfo.cpp | 53 int Idx = Intrinsic::lookupLLVMIntrinsicByName(IntrinsicNameTable, Name);
54 if (Idx >= 0) {
55 bool IsPrefixMatch = Name.size() > strlen(IntrinsicNameTable[Idx]);
56 return IsPrefixMatch == isOverloaded(Idx + 1)
57 ? Intrinsic::num_intrinsics + Idx
|
| /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) { }
112 SourceLocation TemplateKWLoc = ReadSourceLocation(Record, Idx);
114 ArgInfo.setLAngleLoc(ReadSourceLocation(Record, Idx));
115 ArgInfo.setRAngleLoc(ReadSourceLocation(Record, Idx));
118 Reader.ReadTemplateArgumentLoc(F, Record, Idx));
123 assert(Idx == NumStmtFields && "Incorrect statement field count");
128 S->setSemiLoc(ReadSourceLocation(Record, Idx));
[all...] |
| /external/swiftshader/third_party/LLVM/lib/VMCore/ |
| DebugLoc.cpp | 193 int &Idx = ScopeRecordIdx[Scope];
194 if (Idx) return Idx;
198 return Idx = ExistingIdx;
208 Idx = ScopeRecords.size()+1;
209 ScopeRecords.push_back(DebugRecVH(Scope, this, Idx));
210 return Idx;
216 int &Idx = ScopeInlinedAtIdx[std::make_pair(Scope, IA)];
217 if (Idx) return Idx;
[all...] |
| /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...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| PackedVector.h | 30 static T getValue(const llvm::BitVector &Bits, unsigned Idx) {
33 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i));
37 static void setValue(llvm::BitVector &Bits, unsigned Idx, T val) {
40 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i);
47 static T getValue(const llvm::BitVector &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(llvm::BitVector &Bits, unsigned Idx, T val) {
59 Bits.set((Idx << (BitNum-1)) + BitNum-1);
63 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i)
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/ |
| PackedVector.h | 31 static T getValue(const BitVectorTy &Bits, unsigned Idx) {
34 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i));
38 static void setValue(BitVectorTy &Bits, unsigned Idx, T val) {
41 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i);
48 static T getValue(const BitVectorTy &Bits, unsigned Idx) {
51 val = T(val | ((Bits[(Idx << (BitNum-1)) + i] ? 1UL : 0UL) << i));
52 if (Bits[(Idx << (BitNum-1)) + BitNum-1])
57 static void setValue(BitVectorTy &Bits, unsigned Idx, T val) {
60 Bits.set((Idx << (BitNum-1)) + BitNum-1);
64 Bits[(Idx << (BitNum-1)) + i] = val & (T(1) << i)
[all...] |
| /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/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/ |
| HexagonBlockRanges.h | 55 IndexType(unsigned Idx) : Index(Idx) {}
61 bool operator== (IndexType Idx) const;
63 bool operator!= (IndexType Idx) const;
65 bool operator< (unsigned Idx) const;
66 bool operator< (IndexType Idx) const;
67 bool operator<= (IndexType Idx) const;
70 bool operator> (IndexType Idx) const;
71 bool operator>= (IndexType Idx) const;
127 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...] |
| /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/swiftshader/third_party/llvm-7.0/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 __asan_unpoison_memory_region(Entry, Capacity::get(Idx).getSize());
51 Bucket[Idx] = Entry->Next;
52 __msan_allocated_memory(Entry, Capacity::get(Idx).getSize());
56 // Add an entry to the free list at Bucket[Idx].
57 void push(unsigned Idx, T *Ptr) {
60 if (Idx >= Bucket.size()
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Bitcode/Reader/ |
| ValueList.cpp | 69 void BitcodeReaderValueList::assignValue(Value *V, unsigned Idx) {
70 if (Idx == size()) {
75 if (Idx >= size())
76 resize(Idx + 1);
78 WeakTrackingVH &OldV = ValuePtrs[Idx];
87 ResolveConstants.push_back(std::make_pair(PHC, Idx));
97 Constant *BitcodeReaderValueList::getConstantFwdRef(unsigned Idx, Type *Ty) {
98 if (Idx >= size())
99 resize(Idx + 1);
101 if (Value *V = ValuePtrs[Idx]) {
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| ScalarizeMaskedMemIntrin.cpp | 161 for (unsigned Idx = 0; Idx < VectorWidth; ++Idx) {
162 if (cast<ConstantVector>(Mask)->getOperand(Idx)->isNullValue())
165 Builder.CreateInBoundsGEP(EltTy, FirstEltPtr, Builder.getInt32(Idx));
168 Builder.CreateInsertElement(VResult, Load, Builder.getInt32(Idx));
179 for (unsigned Idx = 0; Idx < VectorWidth; ++Idx) {
183 // %mask_1 = extractelement <16 x i1> %mask, i32 Idx
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/ |
| TestGraph.h | 32 static void ValidateIndex(unsigned Idx) {
33 assert(Idx < N && "Invalid node index!");
57 void AddNode(unsigned Idx) {
58 ValidateIndex(Idx);
59 Elements |= 1U << Idx;
63 void DeleteNode(unsigned Idx) {
64 ValidateIndex(Idx);
65 Elements &= ~(1U << Idx);
69 bool count(unsigned Idx) {
70 ValidateIndex(Idx);
[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;
|
