| /external/llvm/lib/CodeGen/ |
| SafeStackLayout.cpp | 27 OS << " " << i << ": [" << Regions[i].Start << ", " << Regions[i].End
51 unsigned LastRegionEnd = Regions.empty() ? 0 : Regions.back().End;
53 unsigned End = Start + Obj.Size;
54 Regions.emplace_back(Start, End, Obj.Range);
55 ObjectOffsets[Obj.Handle] = End;
63 unsigned End = Start + Obj.Size;
64 DEBUG(dbgs() << " First candidate: " << Start << " .. " << End << "\n");
66 DEBUG(dbgs() << " Examining region: " << R.Start << " .. " << R.End
68 assert(End >= R.Start);
69 if (Start >= R.End) {
[all...] |
| SafeStackLayout.h | 24 unsigned End;
26 StackRegion(unsigned Start, unsigned End,
28 : Start(Start), End(End), Range(Range) {}
58 unsigned getFrameSize() { return Regions.empty() ? 0 : Regions.back().End; }
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Support/ |
| Parallel.h | 86 void parallel_sort(RandomAccessIterator Start, RandomAccessIterator End,
88 concurrency::parallel_sort(Start, End, Comp);
91 void parallel_for_each(IterTy Begin, IterTy End, FuncTy Fn) {
92 concurrency::parallel_for_each(Begin, End, Fn);
96 void parallel_for_each_n(IndexTy Begin, IndexTy End, FuncTy Fn) {
97 concurrency::parallel_for(Begin, End, Fn);
106 RandomAccessIterator End,
108 RandomAccessIterator Mid = Start + (std::distance(Start, End) / 2);
109 return Comp(*Start, *(End - 1))
110 ? (Comp(*Mid, *(End - 1)) ? (Comp(*Start, *Mid) ? Mid : Start
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Support/ |
| Parallel.h | 86 void parallel_sort(RandomAccessIterator Start, RandomAccessIterator End,
88 concurrency::parallel_sort(Start, End, Comp);
91 void parallel_for_each(IterTy Begin, IterTy End, FuncTy Fn) {
92 concurrency::parallel_for_each(Begin, End, Fn);
96 void parallel_for_each_n(IndexTy Begin, IndexTy End, FuncTy Fn) {
97 concurrency::parallel_for(Begin, End, Fn);
106 RandomAccessIterator End,
108 RandomAccessIterator Mid = Start + (std::distance(Start, End) / 2);
109 return Comp(*Start, *(End - 1))
110 ? (Comp(*Mid, *(End - 1)) ? (Comp(*Start, *Mid) ? Mid : Start
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Support/ |
| Parallel.h | 86 void parallel_sort(RandomAccessIterator Start, RandomAccessIterator End,
88 concurrency::parallel_sort(Start, End, Comp);
91 void parallel_for_each(IterTy Begin, IterTy End, FuncTy Fn) {
92 concurrency::parallel_for_each(Begin, End, Fn);
96 void parallel_for_each_n(IndexTy Begin, IndexTy End, FuncTy Fn) {
97 concurrency::parallel_for(Begin, End, Fn);
106 RandomAccessIterator End,
108 RandomAccessIterator Mid = Start + (std::distance(Start, End) / 2);
109 return Comp(*Start, *(End - 1))
110 ? (Comp(*Mid, *(End - 1)) ? (Comp(*Start, *Mid) ? Mid : Start
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Support/ |
| Parallel.h | 86 void parallel_sort(RandomAccessIterator Start, RandomAccessIterator End,
88 concurrency::parallel_sort(Start, End, Comp);
91 void parallel_for_each(IterTy Begin, IterTy End, FuncTy Fn) {
92 concurrency::parallel_for_each(Begin, End, Fn);
96 void parallel_for_each_n(IndexTy Begin, IndexTy End, FuncTy Fn) {
97 concurrency::parallel_for(Begin, End, Fn);
106 RandomAccessIterator End,
108 RandomAccessIterator Mid = Start + (std::distance(Start, End) / 2);
109 return Comp(*Start, *(End - 1))
110 ? (Comp(*Mid, *(End - 1)) ? (Comp(*Start, *Mid) ? Mid : Start
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Support/ |
| Parallel.h | 86 void parallel_sort(RandomAccessIterator Start, RandomAccessIterator End,
88 concurrency::parallel_sort(Start, End, Comp);
91 void parallel_for_each(IterTy Begin, IterTy End, FuncTy Fn) {
92 concurrency::parallel_for_each(Begin, End, Fn);
96 void parallel_for_each_n(IndexTy Begin, IndexTy End, FuncTy Fn) {
97 concurrency::parallel_for(Begin, End, Fn);
106 RandomAccessIterator End,
108 RandomAccessIterator Mid = Start + (std::distance(Start, End) / 2);
109 return Comp(*Start, *(End - 1))
110 ? (Comp(*Mid, *(End - 1)) ? (Comp(*Start, *Mid) ? Mid : Start
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Support/ |
| Parallel.h | 86 void parallel_sort(RandomAccessIterator Start, RandomAccessIterator End,
88 concurrency::parallel_sort(Start, End, Comp);
91 void parallel_for_each(IterTy Begin, IterTy End, FuncTy Fn) {
92 concurrency::parallel_for_each(Begin, End, Fn);
96 void parallel_for_each_n(IndexTy Begin, IndexTy End, FuncTy Fn) {
97 concurrency::parallel_for(Begin, End, Fn);
106 RandomAccessIterator End,
108 RandomAccessIterator Mid = Start + (std::distance(Start, End) / 2);
109 return Comp(*Start, *(End - 1))
110 ? (Comp(*Mid, *(End - 1)) ? (Comp(*Start, *Mid) ? Mid : Start
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Support/ |
| Parallel.h | 86 void parallel_sort(RandomAccessIterator Start, RandomAccessIterator End,
88 concurrency::parallel_sort(Start, End, Comp);
91 void parallel_for_each(IterTy Begin, IterTy End, FuncTy Fn) {
92 concurrency::parallel_for_each(Begin, End, Fn);
96 void parallel_for_each_n(IndexTy Begin, IndexTy End, FuncTy Fn) {
97 concurrency::parallel_for(Begin, End, Fn);
106 RandomAccessIterator End,
108 RandomAccessIterator Mid = Start + (std::distance(Start, End) / 2);
109 return Comp(*Start, *(End - 1))
110 ? (Comp(*Mid, *(End - 1)) ? (Comp(*Start, *Mid) ? Mid : Start
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Support/ |
| Parallel.h | 86 void parallel_sort(RandomAccessIterator Start, RandomAccessIterator End,
88 concurrency::parallel_sort(Start, End, Comp);
91 void parallel_for_each(IterTy Begin, IterTy End, FuncTy Fn) {
92 concurrency::parallel_for_each(Begin, End, Fn);
96 void parallel_for_each_n(IndexTy Begin, IndexTy End, FuncTy Fn) {
97 concurrency::parallel_for(Begin, End, Fn);
106 RandomAccessIterator End,
108 RandomAccessIterator Mid = Start + (std::distance(Start, End) / 2);
109 return Comp(*Start, *(End - 1))
110 ? (Comp(*Mid, *(End - 1)) ? (Comp(*Start, *Mid) ? Mid : Start
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Support/ |
| Parallel.h | 86 void parallel_sort(RandomAccessIterator Start, RandomAccessIterator End,
88 concurrency::parallel_sort(Start, End, Comp);
91 void parallel_for_each(IterTy Begin, IterTy End, FuncTy Fn) {
92 concurrency::parallel_for_each(Begin, End, Fn);
96 void parallel_for_each_n(IndexTy Begin, IndexTy End, FuncTy Fn) {
97 concurrency::parallel_for(Begin, End, Fn);
106 RandomAccessIterator End,
108 RandomAccessIterator Mid = Start + (std::distance(Start, End) / 2);
109 return Comp(*Start, *(End - 1))
110 ? (Comp(*Mid, *(End - 1)) ? (Comp(*Start, *Mid) ? Mid : Start
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Support/ |
| Parallel.h | 86 void parallel_sort(RandomAccessIterator Start, RandomAccessIterator End,
88 concurrency::parallel_sort(Start, End, Comp);
91 void parallel_for_each(IterTy Begin, IterTy End, FuncTy Fn) {
92 concurrency::parallel_for_each(Begin, End, Fn);
96 void parallel_for_each_n(IndexTy Begin, IndexTy End, FuncTy Fn) {
97 concurrency::parallel_for(Begin, End, Fn);
106 RandomAccessIterator End,
108 RandomAccessIterator Mid = Start + (std::distance(Start, End) / 2);
109 return Comp(*Start, *(End - 1))
110 ? (Comp(*Mid, *(End - 1)) ? (Comp(*Start, *Mid) ? Mid : Start
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Support/ |
| Parallel.h | 86 void parallel_sort(RandomAccessIterator Start, RandomAccessIterator End,
88 concurrency::parallel_sort(Start, End, Comp);
91 void parallel_for_each(IterTy Begin, IterTy End, FuncTy Fn) {
92 concurrency::parallel_for_each(Begin, End, Fn);
96 void parallel_for_each_n(IndexTy Begin, IndexTy End, FuncTy Fn) {
97 concurrency::parallel_for(Begin, End, Fn);
106 RandomAccessIterator End,
108 RandomAccessIterator Mid = Start + (std::distance(Start, End) / 2);
109 return Comp(*Start, *(End - 1))
110 ? (Comp(*Mid, *(End - 1)) ? (Comp(*Start, *Mid) ? Mid : Start
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Support/ |
| Parallel.h | 86 void parallel_sort(RandomAccessIterator Start, RandomAccessIterator End,
88 concurrency::parallel_sort(Start, End, Comp);
91 void parallel_for_each(IterTy Begin, IterTy End, FuncTy Fn) {
92 concurrency::parallel_for_each(Begin, End, Fn);
96 void parallel_for_each_n(IndexTy Begin, IndexTy End, FuncTy Fn) {
97 concurrency::parallel_for(Begin, End, Fn);
106 RandomAccessIterator End,
108 RandomAccessIterator Mid = Start + (std::distance(Start, End) / 2);
109 return Comp(*Start, *(End - 1))
110 ? (Comp(*Mid, *(End - 1)) ? (Comp(*Start, *Mid) ? Mid : Start
[all...] |
| /device/linaro/bootloader/edk2/BaseTools/Source/Python/Eot/ |
| CodeFragment.py | 16 ## The description of comment contents and start & end position
25 # @param End The end position tuple.
28 def __init__(self, Str, Begin, End, CommentType):
31 self.EndPos = End
34 ## The description of preprocess directives and start & end position
43 # @param End The end position tuple.
45 def __init__(self, Str, Begin, End):
48 self.EndPos = End
[all...] |
| /external/swiftshader/third_party/LLVM/lib/MC/ |
| MCModule.cpp | 16 uint64_t Begin, uint64_t End) {
17 assert(Begin < End && "Creating MCAtom with endpoints reversed?");
21 assert((!I.valid() || I.start() < End) && "Offset range already occupied!");
24 MCAtom *NewAtom = new MCAtom(Type, this, Begin, End);
26 OffsetMap.insert(Begin, End, NewAtom);
43 Atom->End = NewEnd;
|
| /toolchain/binutils/binutils-2.27/binutils/testsuite/binutils-all/ |
| testranges-ia64.d | 9 Offset Begin End
11 00000000 <End of list>
13 00000010 <End of list>
|
| testranges.d | 9 Offset Begin End
11 00000000 <End of list>
13 00000010 <End of list>
|
| /device/linaro/bootloader/edk2/BaseTools/Source/Python/Ecc/ |
| CodeFragment.py | 16 ## The description of comment contents and start & end position
25 # @param End The end position tuple.
28 def __init__(self, Str, Begin, End, CommentType):
31 self.EndPos = End
34 ## The description of preprocess directives and start & end position
43 # @param End The end position tuple.
45 def __init__(self, Str, Begin, End):
48 self.EndPos = End
[all...] |
| /external/llvm/utils/count/ |
| count.c | 15 char Buffer[4096], *End;
22 Count = strtol(argv[1], &End, 10);
23 if (*End != '\0' && End != argv[1]) {
|
| /external/swiftshader/third_party/LLVM/utils/count/ |
| count.c | 15 char Buffer[4096], *End;
22 Count = strtol(argv[1], &End, 10);
23 if (*End != '\0' && End != argv[1]) {
|
| /external/llvm/tools/sanstats/ |
| sanstats.cpp | 38 uint64_t ReadLE(char Size, const char *Begin, const char *End) {
41 while (Begin < End && Pos != Size) {
49 const char *ReadModule(char SizeofPtr, const char *Begin, const char *End) {
51 while (Begin != End && *Begin)
53 if (Begin == End)
58 if (Begin == End)
67 uint64_t Addr = ReadLE(SizeofPtr, Begin, End);
69 uint64_t Data = ReadLE(SizeofPtr, Begin, End);
72 if (Begin > End)
76 if (Begin == End)
[all...] |
| /external/valgrind/drd/tests/ |
| unit_bitmap.stderr.exp | 2 End of DRD BM unit test.
|
| /device/linaro/bootloader/edk2/UefiCpuPkg/PiSmmCpuDxeSmm/ |
| SyncTimer.c | 38 UINT64 End;
40 TimerFrequency = GetPerformanceCounterProperties (&Start, &End);
45 if (End < Start) {
47 mCycle = Start - End;
50 mCycle = End - Start;
|
| /external/compiler-rt/lib/esan/ |
| esan_shadow.h | 72 // Do not pass in the open-ended end value to the formula as it will fail.
94 uptr End;
140 static inline bool getAppRegion(u32 i, uptr *Start, uptr *End) {
144 *End = AppRegions[i].End;
151 if (Mem >= AppRegions[i].Start && Mem < AppRegions[i].End)
162 static inline bool getShadowRegion(u32 i, uptr *Start, uptr *End) {
177 // The formula fails for the end itself.
178 *End = appToShadow(AppRegions[AppIdx].End - 1) + 1
[all...] |
