| /src/external/apache2/llvm/dist/clang/lib/Lex/ |
| DependencyDirectivesSourceMinimizer.cpp | 57 LLVM_NODISCARD IdInfo lexIdentifier(const char *First, const char *const End);
59 const char *const End);
60 LLVM_NODISCARD bool minimizeImpl(const char *First, const char *const End);
61 LLVM_NODISCARD bool lexPPLine(const char *&First, const char *const End);
62 LLVM_NODISCARD bool lexAt(const char *&First, const char *const End);
63 LLVM_NODISCARD bool lexModule(const char *&First, const char *const End);
64 LLVM_NODISCARD bool lexDefine(const char *&First, const char *const End);
65 LLVM_NODISCARD bool lexPragma(const char *&First, const char *const End);
66 LLVM_NODISCARD bool lexEndif(const char *&First, const char *const End);
68 const char *&First, const char *const End);
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| SafeStackLayout.cpp | 31 OS << " " << i << ": [" << Regions[i].Start << ", " << Regions[i].End
56 unsigned LastRegionEnd = Regions.empty() ? 0 : Regions.back().End;
58 unsigned End = Start + Obj.Size;
59 Regions.emplace_back(Start, End, Obj.Range);
60 ObjectOffsets[Obj.Handle] = End;
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 | 29 unsigned End;
32 StackRegion(unsigned Start, unsigned End,
34 : Start(Start), End(End), Range(Range) {}
71 unsigned getFrameSize() { return Regions.empty() ? 0 : Regions.back().End; }
79 } // end namespace safestack
81 } // end namespace llvm
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-reduce/deltas/ |
| Delta.h | 28 int End;
31 bool contains(int Index) const { return Index >= Begin && Index <= End; }
35 if (End - Begin != 0)
36 errs() << "," << End;
42 return C1.Begin != C2.Begin || C1.End != C2.End;
47 return std::tie(C1.Begin, C1.End) < std::tie(C2.Begin, C2.End);
76 if (ChunksToKeep.front().End == Index)
|
| /src/external/apache2/llvm/dist/llvm/utils/count/ |
| count.c | 14 char Buffer[4096], *End;
21 Count = strtol(argv[1], &End, 10);
22 if (*End != '\0' && End != argv[1]) {
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/GSYM/ |
| Range.h | 32 /// a start and an end address.
35 uint64_t End;
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...] |
| StringTable.h | 29 auto End = Data.find('\0', Offset);
30 return Data.substr(Offset, End - Offset);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| Parallel.h | 80 RandomAccessIterator End,
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)
85 : End - 1)
86 : (Comp(*Mid, *Start) ? (Comp(*(End - 1), *Mid) ? Mid : End - 1)
91 void parallel_quick_sort(RandomAccessIterator Start, RandomAccessIterator End,
94 if (std::distance(Start, End) < detail::MinParallelSize || Depth == 0) {
95 llvm::sort(Start, End, Comp)
[all...] |
| 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!");
62 } // end namespace llvm
|
| /src/external/apache2/llvm/dist/llvm/tools/sanstats/ |
| sanstats.cpp | 39 static uint64_t ReadLE(char Size, const char *Begin, const char *End) {
42 while (Begin < End && Pos != Size) {
51 const char *End) {
53 while (Begin != End && *Begin)
55 if (Begin == End)
64 if (Begin == End)
73 uint64_t Addr = ReadLE(SizeofPtr, Begin, End);
75 uint64_t Data = ReadLE(SizeofPtr, Begin, End);
78 if (Begin > End)
82 if (Begin == End)
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/Analysis/Support/ |
| BumpVector.h | 61 T *End = nullptr;
73 destroy_range(Begin, End);
94 iterator end() { return End; } function in class:clang::BumpVector
95 const_iterator end() const { return End; } function in class:clang::BumpVector
98 reverse_iterator rbegin() { return reverse_iterator(end()); }
99 const_reverse_iterator rbegin() const{ return const_reverse_iterator(end()); }
105 bool empty() const { return Begin == End; }
106 size_type size() const { return End-Begin;
[all...] |
| /src/sys/external/bsd/acpica/dist/utilities/ |
| utprint.c | 70 const char *End,
76 char *End,
128 * End - Boundary of the string
140 const char *End,
144 if (String < End)
276 * End - Boundary of the string
292 char *End,
375 String = AcpiUtBoundStringOutput (String, End, ' ');
380 String = AcpiUtBoundStringOutput (String, End, Sign);
384 String = AcpiUtBoundStringOutput (String, End, '0')
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/GSYM/ |
| Range.cpp | 26 while (It2 != Ranges.end() && It2->Start < Range.End)
29 Range.End = std::max(Range.End, It2[-1].End);
32 if (It != Ranges.begin() && Range.Start < It[-1].End)
33 It[-1].End = std::max(It[-1].End, Range.End);
40 Ranges.begin(), Ranges.end(),
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/AST/Interp/ |
| InterpStack.cpp | 43 auto *Object = reinterpret_cast<void *>(Chunk->End);
44 Chunk->End += Size;
59 return reinterpret_cast<void *>(Ptr->End - Size);
71 Chunk->End = Chunk->start();
76 Chunk->End -= Size;
|
| /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/ |
| FuzzerExtraCounters.cpp | 25 uintptr_t *End = reinterpret_cast<uintptr_t*>(ExtraCountersEnd());
26 for (; Beg < End; Beg++) {
|
| /src/external/apache2/llvm/dist/clang/lib/Tooling/Refactoring/Rename/ |
| USRFinder.cpp | 49 SourceLocation End = Range.getEnd();
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) {
63 // FIXME: Add tests for Point == End.
64 return Point == Start || Point == End ||
67 Context.getSourceManager().isBeforeInTranslationUnit(Point, End));
75 } // end anonymous namespac
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/AST/ |
| DeclLookups.h | 29 StoredDeclsMap::iterator It, End;
40 StoredDeclsMap::iterator End)
41 : It(It), End(End) {}
54 } while (It != End &&
80 return lookups_range(all_lookups_iterator(Map->begin(), Map->end()),
81 all_lookups_iterator(Map->end(), Map->end()));
94 return lookups_range(all_lookups_iterator(Map->begin(), Map->end()),
95 all_lookups_iterator(Map->end(), Map->end()))
[all...] |
| ASTVector.h | 39 T *End = nullptr;
42 void setEnd(T *P) { this->End = P; }
54 ASTVector(ASTVector &&O) : Begin(O.Begin), End(O.End), Capacity(O.Capacity) {
55 O.Begin = O.End = nullptr;
70 swap(End, O.End);
78 destroy_range(Begin, End);
99 iterator end() { return End; } function in class:clang::ASTVector
100 const_iterator end() const { return End; } function in class:clang::ASTVector
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/ |
| RegisterBank.cpp | 34 for (unsigned RCId = 0, End = TRI.getNumRegClasses(); RCId != End; ++RCId) {
45 for (unsigned SubRCId = 0; SubRCId != End; ++SubRCId) {
104 for (unsigned RCId = 0, End = TRI->getNumRegClasses(); RCId != End; ++RCId) {
|
| /src/sys/external/bsd/acpica/dist/compiler/ |
| dtio.c | 120 char *End;
133 /* Setup pointers to start and end of input string */
136 End = String + strlen (String) - 1;
140 while ((Start <= End) && ((*Start == ' ') || (*Start == '\t')))
147 while (End >= Start)
149 if (*End == '\n')
151 End--;
155 if (*End != ' ')
160 End--;
169 if (*End == '\"'
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/Rewrite/Core/ |
| RewriteRope.h | 65 unsigned End)
66 : StrData(std::move(Str)), StartOffs(Start), EndOffs(End) {}
153 iterator end() const { return iterator(); } function in class:clang::RopePieceBTree
188 iterator end() const { return Chunks.end(); } function in class:clang::RewriteRope
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
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| GCNIterativeScheduler.cpp | 46 MachineBasicBlock::iterator End,
55 for (; I != End && MaxInstNum; ++I, --MaxInstNum) {
60 if (I != End) {
62 I = std::prev(End);
67 if (End != BB->end()) { // print boundary inst if present
69 if (LIS) OS << LIS->getInstructionIndex(*End) << '\t';
70 OS << *End;
77 MachineBasicBlock::iterator End,
86 const auto BottomMI = End == BB->end() ? std::prev(End) : End
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/PDB/Native/ |
| NativeFunctionSymbol.cpp | 110 auto End = Syms.at(Sym.End);
111 while (Start != End) {
113 // Find matching inline site within Start and End.
114 for (; Start != End; ++Start) {
128 End = Syms.at(IS.End);
133 Start = Syms.at(IS.End);
134 if (Start == End)
|
| /src/external/apache2/llvm/dist/llvm/tools/llvm-profgen/ |
| ProfileGenerator.h | 41 For each region boundary point, mark if it is begin or end (or both) of
45 count that share same begin/end point. We need to accumulate the sample
85 // End indicates the end location of current iteration's data
86 uint32_t End = 0;
95 // the new one by appending them at the back of End pointer(for the next
104 // right half of the window(End = 0), then slide the window.
105 // Result: [a1], a2, b1, b2 (End points to the element right before ],
113 // new) to the End and slide the window.
127 End = I
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Tooling/Refactoring/Extract/ |
| SourceExtraction.cpp | 66 } // end anonymous namespace
95 /// Some statements might end at ';'. The extraction will move that ';', so
97 SourceLocation End = ExtractedRange.getEnd();
98 if (isSemicolonAtLocation(End, SM, LangOpts))
103 Optional<Token> NextToken = Lexer::findNextToken(End, SM, LangOpts);
105 areOnSameLine(NextToken->getLocation(), End, SM)) {
114 } // end namespace tooling
115 } // end namespace clang
|
