| /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...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/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...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/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...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/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...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/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...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/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...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/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...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/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...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/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/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/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...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/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...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/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...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/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...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/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...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/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...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/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...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/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...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/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...] |
