| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| AliasAnalysisEvaluator.cpp | 13 // pointers in the function.
134 SetVector<Value *> Pointers;
139 Pointers.insert(I);
143 Pointers.insert(&*I);
149 Pointers.insert(Callee);
154 Pointers.insert(*AI);
161 Pointers.insert(*OI);
167 errs() << "Function: " << F.getName() << ": " << Pointers.size()
168 << " pointers, " << CallSites.size() << " call sites\n";
171 for (SetVector<Value *>::iterator I1 = Pointers.begin(), E = Pointers.end()
[all...] |
| /external/llvm/lib/Analysis/ |
| AliasAnalysisEvaluator.cpp | 101 SetVector<Value *> Pointers;
108 Pointers.insert(&I);
112 Pointers.insert(&*I);
122 Pointers.insert(Callee);
126 Pointers.insert(DataOp);
133 Pointers.insert(*OI);
139 errs() << "Function: " << F.getName() << ": " << Pointers.size()
140 << " pointers, " << CallSites.size() << " call sites\n";
143 for (SetVector<Value *>::iterator I1 = Pointers.begin(), E = Pointers.end()
[all...] |
| LoopAccessAnalysis.cpp | 187 Pointers.emplace_back(Ptr, ScStart, ScEnd, WritePtr, DepSetId, ASId, Sc);
237 const SCEV *Start = RtCheck.Pointers[Index].Start;
238 const SCEV *End = RtCheck.Pointers[Index].End;
267 // - We know that pointers in the same equivalence class share
269 // that we can compare pointers
270 // - We wouldn't be able to merge two pointers for which we need
272 // conveniently built such that no two pointers in the same
284 // If we need to check two pointers to the same underlying object
286 // grouping with those pointers. This is because we can easily get
303 // separate checking groups for all pointers
[all...] |
| /external/llvm/unittests/Analysis/ |
| AliasAnalysisTest.cpp | 48 SetVector<Value *> Pointers;
51 Pointers.insert(&A);
54 Pointers.insert(&I);
56 for (Value *P1 : Pointers)
57 for (Value *P2 : Pointers)
|
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/Analysis/ |
| AliasAnalysisTest.cpp | 48 SetVector<Value *> Pointers;
51 Pointers.insert(&A);
54 Pointers.insert(&I);
56 for (Value *P1 : Pointers)
57 for (Value *P2 : Pointers)
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/ |
| LoopAccessAnalysis.h | 64 /// different underlying pointers. Clients, such as the loop vectorizer, will
310 /// that a group of pointers do not overlap.
324 /// Holds the id of the set of pointers that could be dependent because of a
345 Pointers.clear();
359 bool empty() const { return Pointers.empty(); }
361 /// A grouping of pointers. A single memcheck is required between
367 : RtCheck(RtCheck), High(RtCheck.Pointers[Index].End),
368 Low(RtCheck.Pointers[Index].Start) {
384 /// pointers in this group.
387 /// pointers in this group
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
| AliasAnalysisEvaluator.cpp | 100 SetVector<Value *> Pointers;
107 Pointers.insert(&I);
111 Pointers.insert(&*I);
121 Pointers.insert(Callee);
125 Pointers.insert(DataOp);
132 Pointers.insert(*OI);
138 errs() << "Function: " << F.getName() << ": " << Pointers.size()
139 << " pointers, " << CallSites.size() << " call sites\n";
142 for (SetVector<Value *>::iterator I1 = Pointers.begin(), E = Pointers.end()
[all...] |
| LoopAccessAnalysis.cpp | 231 Pointers.emplace_back(Ptr, ScStart, ScEnd, WritePtr, DepSetId, ASId, Sc);
281 const SCEV *Start = RtCheck.Pointers[Index].Start;
282 const SCEV *End = RtCheck.Pointers[Index].End;
311 // - We know that pointers in the same equivalence class share
313 // that we can compare pointers
314 // - We wouldn't be able to merge two pointers for which we need
316 // conveniently built such that no two pointers in the same
328 // If we need to check two pointers to the same underlying object
330 // grouping with those pointers. This is because we can easily get
347 // separate checking groups for all pointers
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/IR/ |
| DataLayout.cpp | 438 Alignments == Other.Alignments && Pointers == Other.Pointers;
488 return std::lower_bound(Pointers.begin(), Pointers.end(), AddressSpace,
502 if (I == Pointers.end() || I->AddressSpace != AddrSpace) {
503 Pointers.insert(I, PointerAlignElem::get(AddrSpace, ABIAlign, PrefAlign,
579 Pointers.clear();
613 if (I == Pointers.end() || I->AddressSpace != AS) {
622 if (I == Pointers.end() || I->AddressSpace != AS) {
631 if (I == Pointers.end() || I->AddressSpace != AS)
[all...] |
| /device/linaro/bootloader/edk2/UefiCpuPkg/ResetVector/Vtf0/X64/ |
| PageTables.asm | 52 ; Top level Page Directory Pointers (1 * 512GB entry)
58 ; Next level Page Directory Pointers (4 * 1GB entries => 4GB)
|
| /external/llvm/lib/IR/ |
| DataLayout.cpp | 392 Alignments == Other.Alignments && Pointers == Other.Pointers;
431 return std::lower_bound(Pointers.begin(), Pointers.end(), AddressSpace,
445 if (I == Pointers.end() || I->AddressSpace != AddrSpace) {
446 Pointers.insert(I, PointerAlignElem::get(AddrSpace, ABIAlign, PrefAlign,
547 Pointers.clear();
582 if (I == Pointers.end() || I->AddressSpace != AS) {
591 if (I == Pointers.end() || I->AddressSpace != AS) {
600 if (I == Pointers.end() || I->AddressSpace != AS)
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LoopAccessAnalysis.h | 95 /// different underlying pointers. Clients, such as the loop vectorizer, will
331 /// that a group of pointers do not overlap.
343 /// Holds the id of the set of pointers that could be dependent because of a
364 Pointers.clear();
378 bool empty() const { return Pointers.empty(); }
380 /// A grouping of pointers. A single memcheck is required between
386 : RtCheck(RtCheck), High(RtCheck.Pointers[Index].End),
387 Low(RtCheck.Pointers[Index].Start) {
403 /// pointers in this group.
406 /// pointers in this group
[all...] |
| /device/linaro/bootloader/edk2/OvmfPkg/ResetVector/Ia32/ |
| PageTables64.asm | 64 ; Top level Page Directory Pointers (1 * 512GB entry)
69 ; Next level Page Directory Pointers (4 * 1GB entries => 4GB)
|
| /external/llvm/include/llvm/IR/ |
| DataLayout.h | 127 PointersTy Pointers;
201 Pointers = DL.Pointers;
313 /// Return target's alignment for stack-based pointers
332 /// If this function is called with a vector of pointers, then the type size
334 /// vector of pointers.
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/IR/ |
| DataLayout.h | 150 PointersTy Pointers;
162 /// Pointers in these address spaces are non-integral, and don't have a
207 Pointers = DL.Pointers;
327 /// Return target's alignment for stack-based pointers
340 /// Return the address spaces containing non-integral pointers. Pointers in
371 /// If this function is called with a vector of pointers, then the type size
373 /// vector of pointers.
377 /// The function should be called with pointer or vector of pointers type
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| DeadStoreElimination.cpp | 316 // If the start pointers are the same, we just have to compare sizes to see if
330 // If we can't resolve the same pointers to the same object, then we can't
341 // Okay, we have stores to two completely different pointers. Try to
343 // pointers are equal, then we can reason about the two stores.
349 // If the base pointers still differ, we have two completely different stores.
473 /// trivially removed) but a case where two pointers may alias.
679 // Find all of the alloca'd pointers in the entry block.
706 SmallVector<Value *, 4> Pointers;
707 GetUnderlyingObjects(getStoredPointerOperand(&*BBI), Pointers, DL);
711 for (Value *Pointer : Pointers)
[all...] |
| LoopDistribute.cpp | 455 unsigned N = RtPtrCheck->Pointers.size();
458 Value *Ptr = RtPtrCheck->Pointers[I].PointerValue;
460 LAI.getInstructionsForAccess(Ptr, RtPtrCheck->Pointers[I].IsWritePtr);
790 /// \brief Filter out checks between pointers from the same partition.
792 /// \p PtrToPartition contains the partition number for pointers. Partition
806 // Only include this check if there is a pair of pointers
807 // that require checking and the pointers fall into
812 // that each pair of pointers within the two groups need
816 // because there is a pair of pointers between the two
818 // pair whose pointers fall into different partitions.
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Scalar/ |
| DeadStoreElimination.cpp | 360 // If the start pointers are the same, we just have to compare sizes to see if
374 // If we can't resolve the same pointers to the same object, then we can't
385 // Okay, we have stores to two completely different pointers. Try to
387 // pointers are equal, then we can reason about the two stores.
393 // If the base pointers still differ, we have two completely different stores.
534 /// trivially removed) but a case where two pointers may alias.
758 // Find all of the alloca'd pointers in the entry block.
785 SmallVector<Value *, 4> Pointers;
786 GetUnderlyingObjects(getStoredPointerOperand(&*BBI), Pointers, DL);
790 for (Value *Pointer : Pointers)
[all...] |
| LoopDistribute.cpp | 491 unsigned N = RtPtrCheck->Pointers.size();
494 Value *Ptr = RtPtrCheck->Pointers[I].PointerValue;
496 LAI.getInstructionsForAccess(Ptr, RtPtrCheck->Pointers[I].IsWritePtr);
840 /// Filter out checks between pointers from the same partition.
842 /// \p PtrToPartition contains the partition number for pointers. Partition
856 // Only include this check if there is a pair of pointers
857 // that require checking and the pointers fall into
862 // that each pair of pointers within the two groups nee
[all...] |
| /external/clang/lib/CodeGen/ |
| CGOpenMPRuntime.cpp | [all...] |
| /external/libbrillo/brillo/ |
| any_unittest.cc | 141 TEST(Any, Pointers) {
189 // using pointers instead of references are more conventional and easier
192 // use pointers instead anyway.
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| hlo_matchers.h | 416 // Helper to convert smart to raw pointers for matching.
418 std::vector<const HloInstruction*> Pointers(const Container& container) {
|
| /external/syzkaller/vendor/github.com/google/go-cmp/cmp/ |
| compare.go | 71 // Pointers are equal if the underlying values they point to are also equal.
|
| /external/googletest/googlemock/test/ |
| gmock-matchers_test.cc | 105 std::vector<std::unique_ptr<int>> pointers; local
106 for (int i : ints) pointers.emplace_back(new int(i));
107 return pointers;
805 // are pointers or references to a derived and a base class, correspondingly.
2318 Pointers pointers; local
[all...] |
| /external/clang/test/SemaCXX/ |
| constant-expression-cxx11.cpp | 227 namespace Pointers {
[all...] |
