| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| SafeStackLayout.cpp | 31 OS << " " << i << ": [" << Regions[i].Start << ", " << Regions[i].End
57 unsigned Start = AdjustStackOffset(LastRegionEnd, Obj.Size, Obj.Alignment);
58 unsigned End = Start + Obj.Size;
59 Regions.emplace_back(Start, End, Obj.Range);
67 unsigned Start = AdjustStackOffset(0, Obj.Size, Obj.Alignment);
68 unsigned End = Start + Obj.Size;
69 LLVM_DEBUG(dbgs() << " First candidate: " << Start << " .. " << End << "\n");
71 LLVM_DEBUG(dbgs() << " Examining region: " << R.Start << " .. " << R.End
73 assert(End >= R.Start);
74 if (Start >= R.End)
[all...] |
| SafeStackLayout.h | 28 unsigned Start;
32 StackRegion(unsigned Start, unsigned End,
34 : Start(Start), End(End), Range(Range) {}
37 /// The list of current stack regions, sorted by StackRegion::Start.
64 /// Returns the offset to the object start in the stack frame.
|
| InterferenceCache.cpp | 132 SlotIndex Start, Stop;
133 std::tie(Start, Stop) = Indexes->getMBBRange(MBBNum);
136 if (PrevPos != Start) {
137 if (!PrevPos.isValid() || Start < PrevPos) {
140 RUI.VirtI.find(Start);
141 RUI.FixedI = RUI.Fixed->find(Start);
146 RUI.VirtI.advanceTo(Start);
148 RUI.FixedI = RUI.Fixed->advanceTo(RUI.FixedI, Start);
151 PrevPos = Start;
168 SlotIndex StartI = I.start();
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/AST/ |
| FormatStringParsing.h | 45 const char *Start, const char *&Beg,
50 const char *Start, const char *&Beg, const char *E,
54 FormatSpecifier &CS, const char *Start,
74 const char *Start;
78 : Start(nullptr), Stop(stop) {}
79 SpecifierResult(const char *start,
81 : FS(fs), Start(start), Stop(false) {}
83 const char *getStart() const { return Start; }
85 bool hasValue() const { return Start != nullptr;
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/IR/ |
| Use.cpp | 37 void Use::zap(Use *Start, const Use *Stop, bool del) {
38 while (Start != Stop)
41 ::operator delete(Start);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| SMLoc.h | 50 SMLoc Start, End;
54 SMRange(SMLoc St, SMLoc En) : Start(St), End(En) {
55 assert(Start.isValid() == End.isValid() &&
56 "Start and End should either both be valid or both be invalid!");
59 bool isValid() const { return Start.isValid(); }
|
| Parallel.h | 79 RandomAccessIterator medianOf3(RandomAccessIterator Start,
82 RandomAccessIterator Mid = Start + (std::distance(Start, End) / 2);
83 return Comp(*Start, *(End - 1))
84 ? (Comp(*Mid, *(End - 1)) ? (Comp(*Start, *Mid) ? Mid : Start)
86 : (Comp(*Mid, *Start) ? (Comp(*(End - 1), *Mid) ? Mid : End - 1)
87 : Start);
91 void parallel_quick_sort(RandomAccessIterator Start, RandomAccessIterator End,
94 if (std::distance(Start, End) < detail::MinParallelSize || Depth == 0)
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/GSYM/ |
| Range.h | 32 /// a start and an end address.
34 uint64_t Start;
36 AddressRange() : Start(0), End(0) {}
37 AddressRange(uint64_t S, uint64_t E) : Start(S), End(E) {}
38 uint64_t size() const { return End - Start; }
39 bool contains(uint64_t Addr) const { return Start <= Addr && Addr < End; }
41 return Start < R.End && R.Start < End;
45 return Start == R.Start && End == R.End
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Tooling/Refactoring/Rename/ |
| USRFinder.cpp | 48 SourceLocation Start = Range.getBegin();
50 if (!Start.isValid() || !Start.isFileID() || !End.isValid() ||
51 !End.isFileID() || !isPointWithin(Start, End))
61 // Determines if the Point is within Start and End.
62 bool isPointWithin(const SourceLocation Start, const SourceLocation End) {
64 return Point == Start || Point == End ||
65 (Context.getSourceManager().isBeforeInTranslationUnit(Start,
83 // see. If both start and end is either before or after the point we're
|
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/GSYM/ |
| Range.cpp | 26 while (It2 != Ranges.end() && It2->Start < Range.End)
32 if (It != Ranges.begin() && Range.Start < It[-1].End)
41 [=](const AddressRange &R) { return R.Start <= Addr; });
50 [=](const AddressRange &R) { return R.Start <= Range.Start; });
60 [=](const AddressRange &R) { return R.Start <= Addr; });
67 return OS << '[' << HEX64(R.Start) << " - " << HEX64(R.End) << ")";
81 assert(Start >= BaseAddr);
82 O.writeULEB(Start - BaseAddr);
91 Start = StartAddr
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/PDB/Native/ |
| NativeFunctionSymbol.cpp | 109 auto Start = Syms.at(RecordOffset);
111 while (Start != End) {
113 // Find matching inline site within Start and End.
114 for (; Start != End; ++Start) {
115 if (Start->kind() != S_INLINESITE)
119 cantFail(SymbolDeserializer::deserializeAs<InlineSiteSym>(*Start));
123 IS, getVirtualAddress(), Modi, Start.offset());
127 ++Start;
133 Start = Syms.at(IS.End)
[all...] |
| /src/sys/external/bsd/acpica/dist/compiler/ |
| dtio.c | 119 char *Start;
125 /* Skip lines that start with a space */
133 /* Setup pointers to start and end of input string */
135 Start = String;
140 while ((Start <= End) && ((*Start == ' ') || (*Start == '\t')))
142 Start++;
147 while (End >= Start)
165 if (*Start == '\"'
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/Rewrite/Core/ |
| RewriteRope.h | 64 RopePiece(llvm::IntrusiveRefCntPtr<RopeRefCountString> Str, unsigned Start,
66 : StrData(std::move(Str)), StartOffs(Start), EndOffs(End) {}
195 void assign(const char *Start, const char *End) {
197 if (Start != End)
198 Chunks.insert(0, MakeRopeString(Start, End));
201 void insert(unsigned Offset, const char *Start, const char *End) {
203 if (Start == End) return;
204 Chunks.insert(Offset, MakeRopeString(Start, End));
214 RopePiece MakeRopeString(const char *Start, const char *End);
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-cxxfilt/ |
| llvm-cxxfilt.cpp | 121 auto Start = std::find_if(Head, Source.end(), IsLegalChar);
122 if (Start != Head)
123 OutFragments.push_back({"", Source.slice(0, Start - Head)});
126 while (Start != Source.end()) {
127 Start = std::find_if(Start, Source.end(), IsLegalChar);
128 auto End = std::find_if_not(Start, Source.end(), IsLegalChar);
130 OutFragments.push_back({Source.slice(Start - Head, End - Head),
132 Start = DEnd;
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfExpression.h | 38 DIExpression::expr_op_iterator Start, End;
43 assert(Start == End);
46 Start = Expr->expr_op_begin();
51 : Start(Expr.begin()), End(Expr.end()) {}
57 if (Start == End)
59 return *(Start++);
63 void consume(unsigned N) { std::advance(Start, N); }
67 if (Start == End)
69 return *(Start);
74 if (Start == End
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/DWARF/ |
| DWARFDebugRnglists.cpp | 142 auto Start = LookupPooledAddress(RLE.Value0);
143 if (!Start)
144 Start = {0, -1ULL};
145 E.SectionIndex = Start->SectionIndex;
146 E.LowPC = Start->Address;
151 auto Start = LookupPooledAddress(RLE.Value0);
152 if (!Start)
153 Start = {0, -1ULL};
157 // FIXME: Some error handling if Start.SectionIndex != End.SectionIndex
158 E.SectionIndex = Start->SectionIndex
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/ |
| FuzzerTracePC.cpp | 64 uint8_t *Beg = ModuleCounters[i].Start;
66 assert(Size == (size_t)(ModulePCTable[i].Stop - ModulePCTable[i].Start));
77 UnstableCounters[UnstableIdx].Counter = ModuleCounters[i].Start[j];
86 if (ModuleCounters[i].Start[j] != UnstableCounters[UnstableIdx].Counter) {
93 ModuleCounters[i].Start[j], UnstableCounters[UnstableIdx].Counter);
102 if (ModuleCounters[i].Start[j] != UnstableCounters[UnstableIdx].Counter) {
105 ModuleCounters[i].Start[j] = 0;
107 ModuleCounters[i].Start[j] = std::min(
108 ModuleCounters[i].Start[j], UnstableCounters[UnstableIdx].Counter);
113 void TracePC::HandleInline8bitCountersInit(uint8_t *Start, uint8_t *Stop)
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/AST/Interp/ |
| Disasm.cpp | 49 for (CodePtr Start = getCodeBegin(), PC = Start; PC != getCodeEnd();) {
50 size_t Addr = PC - Start;
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/XRay/ |
| BlockPrinter.h | 25 Start,
36 State CurrentState = State::Start;
55 void reset() { CurrentState = State::Start; }
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/Unix/ |
| Memory.inc | 115 uintptr_t Start = NearBlock ? reinterpret_cast<uintptr_t>(NearBlock->base()) +
120 if (Start && Start % PageSize)
121 Start += PageSize - Start % PageSize;
124 void *Addr = ::mmap(reinterpret_cast<void *>(Start), PageSize*NumPages, Protect,
184 uintptr_t Start = alignAddr((const uint8_t *)M.Address - PageSize.value() + 1, PageSize);
194 int Result = ::mprotect((void *)Start, End - Start, Protect | PROT_READ);
203 int Result = ::mprotect((void *)Start, End - Start, Protect)
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| CoalescingBitVector.h | 87 Bits += 1 + It.stop() - It.start();
109 insert(It.start(), It.stop());
124 return It.start() <= Index;
140 // [Start, Index-1] and another from [Index+1, Stop]. If Index is equal to
141 // either Start or Stop, we create one new interval. If Index is equal to
142 // both Start and Stop, we simply erase the existing interval.
143 IndexT Start = It.start();
144 if (Index < Start)
150 if (Start < Index
[all...] |
| SetVector.h | 59 SetVector(It Start, It End) {
60 insert(Start, End);
150 void insert(It Start, It End) {
151 for (; Start != End; ++Start)
152 if (set_.insert(*Start).second)
153 vector_.push_back(*Start);
314 SmallSetVector(It Start, It End) {
315 this->insert(Start, End);
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| StringExtras.cpp | 42 StringRef::size_type Start = Source.find_first_not_of(Delimiters);
45 StringRef::size_type End = Source.find_first_of(Delimiters, Start);
47 return std::make_pair(Source.slice(Start, End), Source.substr(End));
|
| /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Analyses/ |
| ReachableCode.h | 58 /// ScanReachableFromBlock - Mark all blocks reachable from Start.
60 unsigned ScanReachableFromBlock(const CFGBlock *Start,
|
| /src/external/apache2/llvm/dist/libcxx/benchmarks/ |
| allocation.bench.cpp | 78 PointerList *Start = nullptr;
83 p->Next = Start;
84 Start = p;
87 PointerList *Next = Start;
|
