| /external/swiftshader/third_party/LLVM/utils/FileCheck/ |
| FileCheck.cpp | 55 /// MatchEOF - When set, this pattern only matches the end of file. This is
144 size_t End = PatternStr.find("}}");
145 if (End == StringRef::npos) {
147 "found start of regex string with no end '}}'","error");
158 if (AddRegExToRegEx(PatternStr.substr(2, End-2), CurParen, SM))
162 PatternStr = PatternStr.substr(End+2);
173 size_t End = PatternStr.find("]]");
174 if (End == StringRef::npos) {
180 StringRef MatchStr = PatternStr.substr(2, End-2);
181 PatternStr = PatternStr.substr(End+2)
[all...] |
| /art/runtime/gc/space/ |
| bump_pointer_space.cc | 57 : ContinuousMemMapAllocSpace(name, mem_map, mem_map->Begin(), mem_map->Begin(), mem_map->End(),
59 growth_end_(mem_map->End()),
72 // Reset the end of the space back to the beginning, we move the end forward as we allocate
87 << reinterpret_cast<void*>(Begin()) << "-" << reinterpret_cast<void*>(End()) << " - "
158 uint8_t* end = End(); local
172 end = main_end;
190 while (pos < end) {
196 CHECK_LE(reinterpret_cast<const uint8_t*>(end_obj), End());
[all...] |
| /external/llvm/lib/CodeGen/ |
| SafeStackColoring.cpp | 29 assert(IT != AllocaNumbering.end());
57 // Compute the set of start/end markers per basic block.
98 BlockInfo.End.resize(NumAllocas);
111 << (M.IsStart ? "start " : "end ") << M.AllocaNo << ", "
119 if (BlockInfo.End.test(M.AllocaNo))
120 BlockInfo.End.reset(M.AllocaNo);
125 BlockInfo.End.set(M.AllocaNo);
136 if (It == BlockMarkerSet.end())
160 assert(I != BlockLiveness.end() && "Predecessor not found");
164 // Compute LiveOut by subtracting out lifetimes that end in thi
[all...] |
| SplitKit.cpp | 64 if (FirstTerm == MBB.end())
74 for (MachineBasicBlock::const_iterator I = MBB.end(), E = MBB.begin();
116 return MBB.end();
154 array_pod_sort(UseSlots.begin(), UseSlots.end());
158 UseSlots.erase(std::unique(UseSlots.begin(), UseSlots.end(),
160 UseSlots.end());
193 LiveInterval::const_iterator LVE = CurLI->end();
197 UseE = UseSlots.end();
214 // The range shouldn't end mid-block if there are no uses. This shouldn't
216 if (LVI->end < Stop
[all...] |
| /external/mesa3d/src/mesa/swrast/ |
| s_fog.c | 44 if (ctx->Fog.Start == ctx->Fog.End)
47 d = 1.0F / (ctx->Fog.End - ctx->Fog.Start);
48 f = (ctx->Fog.End - z) * d;
92 for (i = 0; i < span->end; i++) { \
110 for (i = 0; i < span->end; i++) { \
164 const GLfloat fogEnd = ctx->Fog.End;
165 const GLfloat fogScale = (ctx->Fog.Start == ctx->Fog.End)
166 ? 1.0F : 1.0F / (ctx->Fog.End - ctx->Fog.Start);
|
| /art/runtime/gc/accounting/ |
| read_barrier_table.h | 76 p < reinterpret_cast<uint32_t*>(mem_map_->End()); ++p) {
110 uint8_t* end = mem_map_->End(); local
111 return entry_addr >= begin && entry_addr < end;
|
| /art/runtime/gc/collector/ |
| immune_spaces.cc | 42 using Interval = std::tuple</*start*/uintptr_t, /*end*/uintptr_t, /*is_heap*/bool>;
51 // Update the end to include the other non-heap sections.
58 reinterpret_cast<uintptr_t>(image_oat_file->End()),
64 std::sort(intervals.begin(), intervals.end());
65 // Intervals are already sorted by begin, if a new interval begins at the end of the current
72 const uintptr_t end = std::get<1>(interval); local
75 << reinterpret_cast<const void*>(end) << " is_heap=" << is_heap;
76 DCHECK_GE(end, begin);
78 // New interval is not at the end of the current one, start a new interval if we are a heap
88 cur_end = end;
[all...] |
| /art/runtime/ |
| vdex_file.h | 100 const uint8_t* End() const { return mmap_->End(); }
|
| /device/linaro/bootloader/edk2/NetworkPkg/Mtftp6Dxe/ |
| Mtftp6Support.h | 20 // The structure representing a range of block numbers, [Start, End].
27 INTN End;
35 different requirements for Start and End. For example, during startup,
47 @param[in] End The last block number.
57 IN UINT16 End
|
| /external/clang/include/clang/CodeGen/ |
| SwiftCallingConv.h | 48 CharUnits End;
52 return End - Begin;
61 void addOpaqueData(CharUnits begin, CharUnits end) {
62 addEntry(nullptr, begin, end);
70 void addTypedData(llvm::Type *type, CharUnits begin, CharUnits end);
115 void addLegalTypedData(llvm::Type *type, CharUnits begin, CharUnits end);
116 void addEntry(llvm::Type *type, CharUnits begin, CharUnits end);
164 } // end namespace swiftcall
165 } // end namespace CodeGen
166 } // end namespace clan
[all...] |
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| CastSizeChecker.cpp | 33 /// Check if we are casting to a struct with a flexible array at the end.
57 RecordDecl::field_iterator End(RD->field_end());
59 for (; Iter != End; ++Iter)
|
| /external/llvm/lib/Option/ |
| OptTable.cpp | 27 // with an exceptions. '\0' comes at the end of the alphabet instead of the
141 E = PrefixesUnion.end(); I != E; ++I) {
143 for (StringRef::const_iterator C = Prefix.begin(), CE = Prefix.end();
145 if (std::find(PrefixChars.begin(), PrefixChars.end(), *C)
146 == PrefixChars.end())
166 E = Prefixes.end(); I != E; ++I)
201 const Info *End = OptionInfos.end();
205 Start = std::lower_bound(Start, End, Name.data());
207 // Options are stored in sorted order, with '\0' at the end of th
[all...] |
| /external/llvm/lib/ProfileData/ |
| ProfileSummaryBuilder.cpp | 63 auto End = CountFrequencies.end();
64 std::sort(DetailedSummaryCutoffs.begin(), DetailedSummaryCutoffs.end());
78 while (CurrSum < DesiredCount && Iter != End) {
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonStoreWidening.cpp | 89 InstrGroup::iterator End, InstrGroup &Group);
94 bool selectStores(InstrGroup::iterator Begin, InstrGroup::iterator End,
222 for (auto I = AllInsns.begin(), E = AllInsns.end(); I != E; ++I) {
241 InstrGroup::iterator Begin, InstrGroup::iterator End, InstrGroup &Group) {
248 for (auto I = Begin; I != End; ++I) {
309 InstrGroup::iterator End, InstrGroup &OG, unsigned &TotalSize,
311 assert(Begin != End && "No instructions to analyze");
314 if (std::distance(Begin, End) <= 1)
357 while (I != End) {
409 for (InstrGroup::iterator I = OG.begin(), E = OG.end(); I != E; ++I)
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Object/ |
| MachOObject.h | 118 size_t End = getStringTableData().find('\0', Index);
119 return getStringTableData().slice(Index, End);
201 } // end namespace object
202 } // end namespace llvm
|
| /external/swiftshader/third_party/LLVM/lib/AsmParser/ |
| LLLexer.cpp | 44 uint64_t LLLexer::atoull(const char *Buffer, const char *End) {
46 for (; Buffer != End; Buffer++) {
58 uint64_t LLLexer::HexIntToVal(const char *Buffer, const char *End) {
60 for (; Buffer != End; ++Buffer) {
79 void LLLexer::HexToIntPair(const char *Buffer, const char *End,
83 assert(Buffer != End);
94 for (int i=0; i<16 && Buffer != End; i++, Buffer++) {
104 if (Buffer != End)
110 void LLLexer::FP80HexToIntPair(const char *Buffer, const char *End,
113 for (int i=0; i<4 && Buffer != End; i++, Buffer++)
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Bitcode/Writer/ |
| ValueEnumerator.h | 90 assert(I != TypeMap.end() && "Type not in ValueEnumerator!");
100 assert(I != AttributeMap.end() && "Attribute not in ValueEnumerator!");
106 void getFunctionConstantRange(unsigned &Start, unsigned &End) const {
108 End = FirstInstID;
151 } // End llvm namespace
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| LiveInterval.cpp | 38 return end();
43 if (Pos < I[Mid].end)
51 /// killedInRange - Return true if the interval has kills in [Start,End).
52 bool LiveInterval::killedInRange(SlotIndex Start, SlotIndex End) const {
54 std::lower_bound(ranges.begin(), ranges.end(), End);
56 // Now r points to the first interval with start >= End, or ranges.end().
61 // Now r points to the last interval with end <= End
[all...] |
| SplitKit.cpp | 70 if (FirstTerm == MBB->end())
80 for (MachineBasicBlock::const_iterator I = MBB->end(), E = MBB->begin();
117 array_pod_sort(UseSlots.begin(), UseSlots.end());
121 UseSlots.erase(std::unique(UseSlots.begin(), UseSlots.end(),
123 UseSlots.end());
156 LiveInterval::const_iterator LVE = CurLI->end();
160 UseE = UseSlots.end();
176 // The range shouldn't end mid-block if there are no uses. This shouldn't
178 if (LVI->end < Stop)
201 while (LVI->end < Stop)
[all...] |
| /external/v8/src/zone/ |
| zone-chunk-list.h | 34 // filled up, a new one gets appended. New chunks appended at the end will
82 // TODO(heimbuef): Add 'rFind', seeking from the end and returning a
88 ForwardZoneChunkListIterator<T> end();
92 ForwardZoneChunkListIterator<const T> end() const;
213 static ForwardZoneChunkListIterator<T> End(ZoneChunkList<T>* list) {
262 if (list->back_ == nullptr) return End(list);
268 return End(list);
274 static ReverseZoneChunkListIterator<T> End(ZoneChunkList<T>* list) {
400 void* end = current->items() + current->position_; local
401 size_t bytes = static_cast<size_t>(reinterpret_cast<uintptr_t>(end)
415 ForwardZoneChunkListIterator<T> ZoneChunkList<T>::end() { function in class:v8::internal::ZoneChunkList::ZoneChunkList
435 ForwardZoneChunkListIterator<const T> ZoneChunkList<T>::end() const { function in class:v8::internal::ZoneChunkList::ZoneChunkList
[all...] |
| /external/v8/tools/clang/rewrite_to_chrome_style/tests/ |
| methods-expected.cc | 54 my_iterator end() {} function in class:blink::Task
66 // Static begin/end/trace don't count, and should be renamed.
68 static my_iterator End() {}
74 // begin()/end() and friends are renamed if they don't return an iterator.
76 int End() { return 0; }
|
| /external/webp/src/utils/ |
| quant_levels_utils.c | 61 if (num_levels_in <= num_levels) goto End; // nothing to do!
134 End:
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/cris/ |
| rd-dw2-7.d | 15 \[0x.*\] Extended opcode 1: End of Sequence
|
| rd-dw2-8.d | 17 \[0x.*\] Extended opcode 1: End of Sequence
|
| /external/llvm/lib/Target/X86/AsmParser/ |
| X86AsmParser.cpp | 703 std::unique_ptr<X86Operand> ParseRoundingModeOp(SMLoc Start, SMLoc End);
704 bool ParseIntelExpression(IntelExprStateMachine &SM, SMLoc &End);
711 bool IsUnevaluatedOperand, SMLoc &End);
718 SMLoc End, unsigned Size, StringRef Identifier,
822 } // end anonymous namespace
[all...] |
