| /external/capstone/ |
| D | MCRegisterInfo.c | 28 void MCRegisterInfo_InitMCRegisterInfo(MCRegisterInfo *RI, in MCRegisterInfo_InitMCRegisterInfo() argument
38 RI->Desc = D; in MCRegisterInfo_InitMCRegisterInfo()
39 RI->NumRegs = NR; in MCRegisterInfo_InitMCRegisterInfo()
40 RI->RAReg = RA; in MCRegisterInfo_InitMCRegisterInfo()
41 RI->PCReg = PC; in MCRegisterInfo_InitMCRegisterInfo()
42 RI->Classes = C; in MCRegisterInfo_InitMCRegisterInfo()
43 RI->DiffLists = DL; in MCRegisterInfo_InitMCRegisterInfo()
44 RI->RegStrings = Strings; in MCRegisterInfo_InitMCRegisterInfo()
45 RI->NumClasses = NC; in MCRegisterInfo_InitMCRegisterInfo()
46 RI->RegUnitRoots = RURoots; in MCRegisterInfo_InitMCRegisterInfo()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/ExecutionEngine/JITLink/ |
| D | MachO_x86_64.cpp | 33 getRelocationKind(const MachO::relocation_info &RI) { in getRelocationKind() argument
34 switch (RI.r_type) { in getRelocationKind()
36 if (!RI.r_pcrel) { in getRelocationKind()
37 if (RI.r_length == 3) in getRelocationKind()
38 return RI.r_extern ? Pointer64 : Pointer64Anon; in getRelocationKind()
39 else if (RI.r_extern && RI.r_length == 2) in getRelocationKind()
44 if (RI.r_pcrel && RI.r_length == 2) in getRelocationKind()
45 return RI.r_extern ? PCRel32 : PCRel32Anon; in getRelocationKind()
48 if (RI.r_pcrel && RI.r_extern && RI.r_length == 2) in getRelocationKind()
52 if (RI.r_pcrel && RI.r_extern && RI.r_length == 2) in getRelocationKind()
[all …]
|
| D | MachO_arm64.cpp | 34 getRelocationKind(const MachO::relocation_info &RI) { in getRelocationKind() argument
35 switch (RI.r_type) { in getRelocationKind()
37 if (!RI.r_pcrel) { in getRelocationKind()
38 if (RI.r_length == 3) in getRelocationKind()
39 return RI.r_extern ? Pointer64 : Pointer64Anon; in getRelocationKind()
40 else if (RI.r_length == 2) in getRelocationKind()
48 if (!RI.r_pcrel && RI.r_extern) { in getRelocationKind()
49 if (RI.r_length == 2) in getRelocationKind()
51 else if (RI.r_length == 3) in getRelocationKind()
56 if (RI.r_pcrel && RI.r_extern && RI.r_length == 2) in getRelocationKind()
[all …]
|
| /external/llvm-project/llvm/lib/ExecutionEngine/JITLink/ |
| D | MachO_arm64.cpp | 34 getRelocationKind(const MachO::relocation_info &RI) { in getRelocationKind() argument
35 switch (RI.r_type) { in getRelocationKind()
37 if (!RI.r_pcrel) { in getRelocationKind()
38 if (RI.r_length == 3) in getRelocationKind()
39 return RI.r_extern ? Pointer64 : Pointer64Anon; in getRelocationKind()
40 else if (RI.r_length == 2) in getRelocationKind()
48 if (!RI.r_pcrel && RI.r_extern) { in getRelocationKind()
49 if (RI.r_length == 2) in getRelocationKind()
51 else if (RI.r_length == 3) in getRelocationKind()
56 if (RI.r_pcrel && RI.r_extern && RI.r_length == 2) in getRelocationKind()
[all …]
|
| D | MachO_x86_64.cpp | 33 getRelocationKind(const MachO::relocation_info &RI) { in getRelocationKind() argument
34 switch (RI.r_type) { in getRelocationKind()
36 if (!RI.r_pcrel) { in getRelocationKind()
37 if (RI.r_length == 3) in getRelocationKind()
38 return RI.r_extern ? Pointer64 : Pointer64Anon; in getRelocationKind()
39 else if (RI.r_extern && RI.r_length == 2) in getRelocationKind()
44 if (RI.r_pcrel && RI.r_length == 2) in getRelocationKind()
45 return RI.r_extern ? PCRel32 : PCRel32Anon; in getRelocationKind()
48 if (RI.r_pcrel && RI.r_extern && RI.r_length == 2) in getRelocationKind()
52 if (RI.r_pcrel && RI.r_extern && RI.r_length == 2) in getRelocationKind()
[all …]
|
| /external/llvm-project/polly/lib/CodeGen/ |
| D | Utils.cpp | 33 LoopInfo *LI, RegionInfo *RI) { in splitEdge() argument
53 if (RI) { in splitEdge()
54 Region *PrevRegion = RI->getRegionFor(Prev); in splitEdge()
55 Region *SuccRegion = RI->getRegionFor(Succ); in splitEdge()
57 RI->setRegionFor(MiddleBlock, PrevRegion); in splitEdge()
59 RI->setRegionFor(MiddleBlock, SuccRegion); in splitEdge()
79 RegionInfo &RI, LoopInfo &LI) { in executeScopConditionally() argument
100 splitEdge(EnteringBB, EntryBB, ".split_new_and_old", &DT, &LI, &RI); in executeScopConditionally()
108 Region *PrevRegion = RI.getRegionFor(EnteringBB); in executeScopConditionally()
113 RI.setRegionFor(SplitBlock, PrevRegion); in executeScopConditionally()
[all …]
|
| /external/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
| D | pop_heap.pass.cpp | 40 typedef random_access_iterator<int *> RI; in test() typedef
41 std::shuffle(RI(ia), RI(ia+N), randomness); in test()
42 std::make_heap(RI(ia), RI(ia+N)); in test()
45 std::pop_heap(RI(ia), RI(ia+i)); in test()
46 assert(std::is_heap(RI(ia), RI(ia+i-1))); in test()
48 std::pop_heap(RI(ia), RI(ia)); in test()
|
| D | pop_heap_comp.pass.cpp | 49 typedef random_access_iterator<int *> RI; in test() typedef
50 std::shuffle(RI(ia), RI(ia+N), randomness); in test()
51 std::make_heap(RI(ia), RI(ia+N), std::greater<int>()); in test()
54 std::pop_heap(RI(ia), RI(ia+i), std::greater<int>()); in test()
55 assert(std::is_heap(RI(ia), RI(ia+i-1), std::greater<int>())); in test()
57 std::pop_heap(RI(ia), RI(ia), std::greater<int>()); in test()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
| D | DwarfEHPrepare.cpp | 55 Value *GetExceptionObject(ResumeInst *RI);
103 Value *DwarfEHPrepare::GetExceptionObject(ResumeInst *RI) { in GetExceptionObject() argument
104 Value *V = RI->getOperand(0); in GetExceptionObject()
124 ExnObj = ExtractValueInst::Create(RI->getOperand(0), 0, "exn.obj", RI); in GetExceptionObject()
126 RI->eraseFromParent(); in GetExceptionObject()
147 for (auto *RI : Resumes) { in pruneUnreachableResumes() local
149 if (isPotentiallyReachable(LP, RI, nullptr, DT)) { in pruneUnreachableResumes()
168 ResumeInst *RI = Resumes[I]; in pruneUnreachableResumes() local
170 Resumes[ResumesLeft++] = RI; in pruneUnreachableResumes()
172 BasicBlock *BB = RI->getParent(); in pruneUnreachableResumes()
[all …]
|
| /external/llvm/lib/CodeGen/ |
| D | DwarfEHPrepare.cpp | 46 Value *GetExceptionObject(ResumeInst *RI);
100 Value *DwarfEHPrepare::GetExceptionObject(ResumeInst *RI) { in GetExceptionObject() argument
101 Value *V = RI->getOperand(0); in GetExceptionObject()
121 ExnObj = ExtractValueInst::Create(RI->getOperand(0), 0, "exn.obj", RI); in GetExceptionObject()
123 RI->eraseFromParent(); in GetExceptionObject()
144 for (auto *RI : Resumes) { in pruneUnreachableResumes() local
146 if (isPotentiallyReachable(LP, RI, DT)) { in pruneUnreachableResumes()
165 ResumeInst *RI = Resumes[I]; in pruneUnreachableResumes() local
167 Resumes[ResumesLeft++] = RI; in pruneUnreachableResumes()
169 BasicBlock *BB = RI->getParent(); in pruneUnreachableResumes()
[all …]
|
| /external/llvm/include/llvm/CodeGen/ |
| D | MachineRegionInfo.h | 68 MachineRegionInfo* RI,
93 MachineRegionInfo RI;
102 return RI;
106 return RI;
148 static NodeType *getEntryNode(MachineRegionInfo *RI) {
149 return GraphTraits<FlatIt<MachineRegion*> >::getEntryNode(RI->getTopLevelRegion());
151 static nodes_iterator nodes_begin(MachineRegionInfo* RI) {
152 return nodes_iterator::begin(getEntryNode(RI));
154 static nodes_iterator nodes_end(MachineRegionInfo *RI) {
155 return nodes_iterator::end(getEntryNode(RI));
[all …]
|
| /external/llvm-project/llvm/lib/CodeGen/ |
| D | DwarfEHPrepare.cpp | 56 Value *GetExceptionObject(ResumeInst *RI);
108 Value *DwarfEHPrepare::GetExceptionObject(ResumeInst *RI) { in GetExceptionObject() argument
109 Value *V = RI->getOperand(0); in GetExceptionObject()
129 ExnObj = ExtractValueInst::Create(RI->getOperand(0), 0, "exn.obj", RI); in GetExceptionObject()
131 RI->eraseFromParent(); in GetExceptionObject()
152 for (auto *RI : Resumes) { in pruneUnreachableResumes() local
154 if (isPotentiallyReachable(LP, RI, nullptr, DT)) { in pruneUnreachableResumes()
173 ResumeInst *RI = Resumes[I]; in pruneUnreachableResumes() local
175 Resumes[ResumesLeft++] = RI; in pruneUnreachableResumes()
177 BasicBlock *BB = RI->getParent(); in pruneUnreachableResumes()
[all …]
|
| /external/llvm/tools/llvm-diff/ |
| D | DifferenceEngine.cpp | 195 BasicBlock::iterator RI = R->begin(); in diff() local
198 assert(LI != LE && RI != R->end()); in diff()
199 Instruction *LeftI = &*LI, *RightI = &*RI; in diff()
213 ++RI; in diff()
219 for (LI = L->begin(), RI = R->begin(); LI != LE; ++LI, ++RI) in diff()
220 unify(&*LI, &*RI); in diff()
224 void runBlockDiff(BasicBlock::iterator LI, BasicBlock::iterator RI);
278 InvokeInst *RI = cast<InvokeInst>(R); in diff() local
279 if (diffCallSites(CallSite(LI), CallSite(RI), Complain)) in diff()
283 tryUnify(LI->getNormalDest(), RI->getNormalDest()); in diff()
[all …]
|
| /external/llvm-project/llvm/tools/llvm-diff/ |
| D | DifferenceEngine.cpp | 194 BasicBlock::iterator RI = R->begin(); in diff() local
197 assert(LI != LE && RI != R->end()); in diff()
198 Instruction *LeftI = &*LI, *RightI = &*RI; in diff()
212 ++RI; in diff()
218 for (LI = L->begin(), RI = R->begin(); LI != LE; ++LI, ++RI) in diff()
219 unify(&*LI, &*RI); in diff()
223 void runBlockDiff(BasicBlock::iterator LI, BasicBlock::iterator RI);
277 InvokeInst &RI = cast<InvokeInst>(*R); in diff() local
278 if (diffCallSites(LI, RI, Complain)) in diff()
282 tryUnify(LI.getNormalDest(), RI.getNormalDest()); in diff()
[all …]
|
| /external/llvm-project/llvm/include/llvm/CodeGen/ |
| D | MachineRegionInfo.h | 64 MachineRegionInfo *RI, MachineDominatorTree *DT,
86 MachineRegionInfo RI;
94 MachineRegionInfo &getRegionInfo() { return RI; }
96 const MachineRegionInfo &getRegionInfo() const { return RI; }
142 static NodeRef getEntryNode(MachineRegionInfo *RI) {
144 RI->getTopLevelRegion());
147 static nodes_iterator nodes_begin(MachineRegionInfo *RI) {
148 return nodes_iterator::begin(getEntryNode(RI));
151 static nodes_iterator nodes_end(MachineRegionInfo *RI) {
152 return nodes_iterator::end(getEntryNode(RI));
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/ |
| D | MachineRegionInfo.h | 64 MachineRegionInfo *RI, MachineDominatorTree *DT,
86 MachineRegionInfo RI;
94 MachineRegionInfo &getRegionInfo() { return RI; }
96 const MachineRegionInfo &getRegionInfo() const { return RI; }
142 static NodeRef getEntryNode(MachineRegionInfo *RI) {
144 RI->getTopLevelRegion());
147 static nodes_iterator nodes_begin(MachineRegionInfo *RI) {
148 return nodes_iterator::begin(getEntryNode(RI));
151 static nodes_iterator nodes_end(MachineRegionInfo *RI) {
152 return nodes_iterator::end(getEntryNode(RI));
[all …]
|
| /external/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
| D | sort_heap.pass.cpp | 35 typedef random_access_iterator<int *> RI; in test() typedef
36 std::shuffle(RI(ia), RI(ia+N), randomness); in test()
37 std::make_heap(RI(ia), RI(ia+N)); in test()
38 std::sort_heap(RI(ia), RI(ia+N)); in test()
39 assert(std::is_sorted(RI(ia), RI(ia+N))); in test()
|
| /external/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.sort/stable.sort/ |
| D | stable_sort.pass.cpp | 26 template <class RI>
28 test_sort_helper(RI f, RI l) in test_sort_helper()
30 typedef typename std::iterator_traits<RI>::value_type value_type; in test_sort_helper()
31 typedef typename std::iterator_traits<RI>::difference_type difference_type; in test_sort_helper()
47 template <class RI>
49 test_sort_driver_driver(RI f, RI l, int start, RI real_last) in test_sort_driver_driver()
51 for (RI i = l; i > f + start;) in test_sort_driver_driver()
63 template <class RI>
65 test_sort_driver(RI f, RI l, int start) in test_sort_driver()
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/ |
| D | sort.pass.cpp | 25 template <class RI>
27 test_sort_helper(RI f, RI l) in test_sort_helper()
29 typedef typename std::iterator_traits<RI>::value_type value_type; in test_sort_helper()
30 typedef typename std::iterator_traits<RI>::difference_type difference_type; in test_sort_helper()
46 template <class RI>
48 test_sort_driver_driver(RI f, RI l, int start, RI real_last) in test_sort_driver_driver()
50 for (RI i = l; i > f + start;) in test_sort_driver_driver()
62 template <class RI>
64 test_sort_driver(RI f, RI l, int start) in test_sort_driver()
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.sort/stable.sort/ |
| D | stable_sort.pass.cpp | 25 template <class RI>
27 test_sort_helper(RI f, RI l) in test_sort_helper()
29 typedef typename std::iterator_traits<RI>::value_type value_type; in test_sort_helper()
30 typedef typename std::iterator_traits<RI>::difference_type difference_type; in test_sort_helper()
46 template <class RI>
48 test_sort_driver_driver(RI f, RI l, int start, RI real_last) in test_sort_driver_driver()
50 for (RI i = l; i > f + start;) in test_sort_driver_driver()
62 template <class RI>
64 test_sort_driver(RI f, RI l, int start) in test_sort_driver()
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/ |
| D | find_first_of.pass.cpp | 30 typedef random_access_iterator<int*> RI; in test_constexpr() typedef
36 …&& (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)))… in test_constexpr()
37 …&& (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib)))… in test_constexpr()
|
| /external/llvm-project/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/ |
| D | find_first_of.pass.cpp | 29 typedef random_access_iterator<int*> RI; in test_constexpr() typedef
35 …&& (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ia)), RI(std::end(ia)))… in test_constexpr()
36 …&& (std::find_first_of(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib)))… in test_constexpr()
|
| /external/llvm-project/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/ |
| D | sort.pass.cpp | 26 template <class RI>
28 test_sort_helper(RI f, RI l) in test_sort_helper()
30 typedef typename std::iterator_traits<RI>::value_type value_type; in test_sort_helper()
31 typedef typename std::iterator_traits<RI>::difference_type difference_type; in test_sort_helper()
47 template <class RI>
49 test_sort_driver_driver(RI f, RI l, int start, RI real_last) in test_sort_driver_driver()
51 for (RI i = l; i > f + start;) in test_sort_driver_driver()
63 template <class RI>
65 test_sort_driver(RI f, RI l, int start) in test_sort_driver()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Instrumentation/ |
| D | ControlHeightReduction.cpp | 178 CHRScope(RegInfo RI) : BranchInsertPoint(nullptr) { in CHRScope() argument
179 assert(RI.R && "Null RegionIn"); in CHRScope()
180 RegInfos.push_back(RI); in CHRScope()
224 for (RegInfo &RI : Next->RegInfos) in append()
225 RegInfos.push_back(RI); in append()
233 for (RegInfo &RI : RegInfos) in addSub()
234 if (RI.R == SubIn->getParentRegion()) { in addSub()
250 [&Boundary](const RegInfo& RI) { in split() argument
251 return Boundary == RI.R; in split()
260 for (RegInfo &RI : TailRegInfos) in split()
[all …]
|
| /external/llvm-project/llvm/unittests/ADT/ |
| D | IListIteratorTest.cpp | 20 simple_ilist<Node>::reverse_iterator RI; in TEST() local
25 EXPECT_EQ(nullptr, RI.getNodePtr()); in TEST()
31 EXPECT_EQ(RI, RI); in TEST()
32 EXPECT_EQ(RI, CRI); in TEST()
33 EXPECT_EQ(CRI, RI); in TEST()
35 EXPECT_EQ(I, RI.getReverse()); in TEST()
36 EXPECT_EQ(RI, I.getReverse()); in TEST()
52 simple_ilist<Node>::reverse_iterator RI; in TEST() local
55 EXPECT_NE(RI, L.rbegin()); in TEST()
56 EXPECT_NE(RI, L.rend()); in TEST()
[all …]
|