| /external/llvm/lib/Target/AArch64/ |
| AArch64A57FPLoadBalancing.cpp | 249 /// Return an instruction that can be used as an iterator for the end
267 unsigned End = KillInst ? KillInstIdx : LastInstIdx;
271 return StartInstIdx <= OtherEnd && Other.StartInstIdx <= End;
279 /// Return true if the group will require a fixup MOV at the end.
305 } // end anonymous namespace
368 for (auto I = EC.begin(), E = EC.end(); I != E; ++I) {
376 std::sort(V.begin(), V.end(),
416 for (auto I = L.begin(), E = L.end(); I != E; ++I) {
452 std::sort(GV.begin(), GV.end(), [](const Chain *G1, const Chain *G2) {
559 if (U.isReg() && U.isUse() && Substs.find(U.getReg()) != Substs.end()) {
[all...] |
| /external/llvm/tools/llvm-rtdyld/ |
| llvm-rtdyld.cpp | 89 TargetAddrEnd("target-addr-end",
90 cl::desc("For -verify only: end of phony target address range."),
250 DILineInfoTable::iterator End = Lines.end();
251 for (DILineInfoTable::iterator It = Begin; It != End; ++It) {
401 // -target-addr-end <e> -- Specify where the phony target address range ends.
403 // end of one section and the start of the next.
432 for (WorklistT::iterator I = Worklist.begin(), E = Worklist.end();
438 if (AI != AppliedMappings.end()) {
444 // If the -target-addr-end option wasn't explicitly passed, then set it to
[all...] |
| /external/v8/include/ |
| v8-util.h | 46 static Iterator End(Impl* impl) { return impl->end(); }
61 if (it == impl->end()) return kPersistentContainerNotFound;
66 if (it == impl->end()) return kPersistentContainerNotFound;
205 for (It i = Traits::Begin(&impl); i != Traits::End(&impl); ++i) {
|
| /art/runtime/base/ |
| arena_allocator.h | 129 uint8_t* End() {
232 auto* end = reinterpret_cast<uint8_t*>(ptr) + ptr_size; variable
234 if (end == ptr_) {
|
| /art/runtime/gc/space/ |
| region_space.h | 32 typedef void(*WalkCallback)(void *start, void *end, size_t num_bytes, void* callback_arg);
240 Region(size_t idx, uint8_t* begin, uint8_t* end)
241 : idx_(idx), begin_(begin), top_(begin), end_(end),
245 DCHECK_LT(begin, end);
246 DCHECK_EQ(static_cast<size_t>(end - begin), kRegionSize);
442 uint8_t* End() const {
466 uint8_t* end_; // The end address of the region.
|
| /art/runtime/ |
| oat_file.cc | 389 if (oat > End()) {
395 if (oat > End()) {
399 End());
413 if (UNLIKELY(oat > End())) {
421 if (UNLIKELY(oat > End())) {
433 if (UNLIKELY(oat > End())) {
453 if (UNLIKELY(oat > End())) {
477 if (UNLIKELY(oat > End())) {
515 const uint8_t* OatFile::End() const {
544 if (primary_it != oat_dex_files_.end()) {
[all...] |
| /external/clang/lib/ARCMigrate/ |
| TransformActions.cpp | 66 FullSourceLoc Begin, End;
73 End = FullSourceLoc(getLocForEndOfToken(endLoc, srcMgr, PP), srcMgr);
76 End = FullSourceLoc(srcMgr.getExpansionLoc(endLoc), srcMgr);
78 assert(Begin.isValid() && End.isValid());
82 if (End.isBeforeInTranslationUnitThan(RHS.Begin))
84 if (RHS.End.isBeforeInTranslationUnitThan(Begin))
87 !RHS.End.isBeforeInTranslationUnitThan(End))
90 RHS.End.isBeforeInTranslationUnitThan(End))
[all...] |
| /external/clang/lib/AST/ |
| DeclPrinter.cpp | 145 Decl** End = Begin + NumDecls;
158 for ( ; Begin != End; ++Begin) {
194 for (AttrVec::const_iterator i=Attrs.begin(), e=Attrs.end(); i!=e; ++i) {
996 Out << "@end";
1017 E = Protocols.end(); I != E; ++I)
1042 Out << "@end";
1056 E = Protocols.end(); I != E; ++I)
1062 Out << "@end";
[all...] |
| /external/clang/lib/Frontend/ |
| VerifyDiagnosticConsumer.cpp | 68 } // End anonymous namespace.
145 // Send the diagnostic to the buffer, we will check it once we reach the end
206 : Begin(S.begin()), End(S.end()), C(Begin), P(Begin), PEnd(nullptr) {}
212 if (PEnd > End)
222 for (; P < End && P[0] >= '0' && P[0] <= '9'; ++P) {
237 P = std::search(C, End, S.begin(), S.end());
239 if (P == End)
258 while (P < End) {
[all...] |
| /external/clang/lib/Lex/ |
| Pragma.cpp | 269 StrVal.erase(StrVal.begin() + ResultPos, StrVal.end() - 1);
333 // Replace the ')' with an EOD to mark the end of the pragma.
337 std::copy(PragmaToks.begin(), PragmaToks.end(), TokArray);
386 // If we reached the end of line, we're done.
486 // Lex tokens at the end of the message and include them in the message.
496 Message.erase(Message.end()-1);
591 if (iter != PragmaPushMacroInfo.end()) {
648 SourceLocation End;
649 if (ConcatenateIncludeName(FileNameBuffer, End))
679 SourceLocation End;
[all...] |
| /external/clang/lib/Serialization/ |
| GlobalModuleIndex.cpp | 199 Modules[ID].Dependencies.insert(Modules[ID].Dependencies.end(),
204 // Make sure we're at the end of the record.
281 if (Known == ModulesByFile.end())
305 if (Known == Table.end()) {
323 if (Known == UnresolvedModules.end()) {
409 if (Known != ModuleFiles.end())
708 MEnd = ModuleFiles.end();
718 Record.append(Name.begin(), Name.end());
722 Record.append(M->second.Dependencies.begin(), M->second.Dependencies.end());
733 IEnd = InterestingIdentifiers.end();
[all...] |
| /external/compiler-rt/lib/lsan/ |
| lsan_common.cc | 109 const char *End() { return Default(); }
133 void ScanRangeForPointers(uptr begin, uptr end,
137 LOG_POINTERS("Scanning %s range %p-%p.\n", region_type, begin, end);
141 for (; pp + sizeof(void *) <= end; pp += alignment) { // NOLINT
170 void ForEachExtraStackRangeCb(uptr begin, uptr end, void* arg) {
172 ScanRangeForPointers(begin, end, frontier, "FAKE STACK", kReachable);
245 uptr begin, end, prot; local
246 while (proc_maps.Next(&begin, &end,
250 uptr intersection_end = Min(end, root_end);
254 root_begin, root_end, begin, end,
[all...] |
| /external/google-breakpad/src/testing/gtest/include/gtest/internal/ |
| gtest-param-util.h | 79 // BaseGenerator()->End().
86 // Current() on an iterator equal to BaseGenerator()->End().
150 virtual ParamIteratorInterface<T>* End() const = 0;
172 iterator end() const { return iterator(impl_->End()); } function in class:testing::internal::ParamGenerator
185 RangeGenerator(T begin, T end, IncrementT step)
186 : begin_(begin), end_(end),
187 step_(step), end_index_(CalculateEndIndex(begin, end, step)) {}
193 virtual ParamIteratorInterface<T>* End() const {
243 const T& end,
[all...] |
| /external/gtest/include/gtest/internal/ |
| gtest-param-util.h | 79 // BaseGenerator()->End().
86 // Current() on an iterator equal to BaseGenerator()->End().
150 virtual ParamIteratorInterface<T>* End() const = 0;
172 iterator end() const { return iterator(impl_->End()); } function in class:testing::internal::ParamGenerator
185 RangeGenerator(T begin, T end, IncrementT step)
186 : begin_(begin), end_(end),
187 step_(step), end_index_(CalculateEndIndex(begin, end, step)) {}
193 virtual ParamIteratorInterface<T>* End() const {
243 const T& end,
[all...] |
| /external/llvm/examples/Kaleidoscope/Chapter5/ |
| toy.cpp | 92 // Comment until end of line.
101 // Check for end of file. Don't eat the EOF.
175 ExprAST *Start, *End, *Step, *Body;
178 ForExprAST(const std::string &varname, ExprAST *start, ExprAST *end,
180 : VarName(varname), Start(start), End(end), Step(step), Body(body) {}
208 } // end anonymous namespace
358 ExprAST *End = ParseExpression();
359 if (End == 0)
379 return new ForExprAST(IdName, Start, End, Step, Body)
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| CallingConvLower.h | 220 // ByValRegs[0] describes how "%r" is stored (Begin == r1, End == r2)
221 // ByValRegs[1] describes how "%t" is stored (Begin == r3, End == r4).
237 Begin(B), End(E), Waste(IsWaste) {}
242 unsigned End;
447 EndReg = info.End;
456 // to the end of collection.
457 // Returns false, if end is reached.
503 } // end namespace llvm
|
| /external/llvm/lib/CodeGen/ |
| SplitKit.cpp | 67 if (FirstTerm == MBB->end())
77 for (MachineBasicBlock::const_iterator I = MBB->end(), E = MBB->begin();
113 return MBB->end();
133 array_pod_sort(UseSlots.begin(), UseSlots.end());
137 UseSlots.erase(std::unique(UseSlots.begin(), UseSlots.end(),
139 UseSlots.end());
172 LiveInterval::const_iterator LVE = CurLI->end();
176 UseE = UseSlots.end();
192 // The range shouldn't end mid-block if there are no uses. This shouldn't
194 if (LVI->end < Stop
[all...] |
| StackColoring.cpp | 100 BitVector End;
146 /// Record the findings in the BEGIN and END vectors.
151 /// the slots, based on the BEGIN/END vectors. Set the LifetimeLIVE_IN and
175 } // end anonymous namespace
202 assert(BI != BlockLiveness.end() && "Block not found");
210 DEBUG(dbgs()<<"END : {");
211 for (unsigned i=0; i < BlockInfo.End.size(); ++i)
212 DEBUG(dbgs()<<BlockInfo.End.test(i)<<" ");
244 BlockInfo.End.resize(NumSlot);
269 // Allocas that start and end within a single block are handle
[all...] |
| /external/llvm/lib/MC/ |
| MachObjectWriter.cpp | 534 ie = Asm.end(); it != ie; ++it, ++Index)
606 std::sort(ExternalSymbolData.begin(), ExternalSymbolData.end());
607 std::sort(UndefinedSymbolData.begin(), UndefinedSymbolData.end());
804 ie = Asm.end(); it != ie; ++it) {
835 ie = Asm.end(); it != ie; ++it) {
[all...] |
| /external/llvm/lib/Support/ |
| raw_ostream.cpp | 361 // formatting directly onto its end.
759 // always pointing past the end of the vector, but within the vector
776 SetBuffer(OS.end(), OS.capacity() - OS.size());
788 uint64_t End = Offset + Size;
789 if (End > OS.size())
790 OS.resize(End);
803 SetBuffer(OS.end(), OS.capacity() - OS.size());
807 if (Ptr == OS.end()) {
818 SetBuffer(OS.end(), OS.capacity() - OS.size());
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonVLIWPacketizer.cpp | 213 for (MachineFunction::iterator MBB = Fn.begin(), MBBe = Fn.end();
215 MachineBasicBlock::iterator End = MBB->end();
217 while (MI != End) {
222 End = MBB->end();
230 for (MachineFunction::iterator MBB = Fn.begin(), MBBe = Fn.end();
234 for(MachineBasicBlock::iterator RegionEnd = MBB->end();
558 VE = CurrentPacketMIs.end();
658 for (VI=CurrentPacketMIs.begin(), VE = CurrentPacketMIs.end();
[all...] |
| /external/llvm/lib/Transforms/IPO/ |
| ArgumentPromotion.cpp | 114 for (CallGraphSCC::iterator I = SCC.begin(), E = SCC.end(); I != E; ++I) {
177 WorkList.insert(WorkList.end(), arg->user_begin(), arg->user_end());
183 WorkList.insert(WorkList.end(), V->user_begin(), V->user_end());
283 // function, we could end up infinitely peeling the function argument.
339 return std::equal(Prefix.begin(), Prefix.end(), Longer.begin());
355 return Low != Set.end() && IsPrefix(*Low, Indices);
373 if (Low != Safe.end()) {
386 std::set<ArgPromotion::IndicesVector>::iterator End = Safe.end();
387 while (Low != End && IsPrefix(ToMark, *Low))
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| MemCpyOptimizer.cpp | 140 // Start/End - A semi range that describes the span that this range covers.
141 // The range is closed at the start and open at the end: [Start, End).
142 int64_t Start, End;
156 } // end anon namespace
160 if (TheStores.size() >= 4 || End-Start >= 16) return true;
183 // size. If so, check to see whether we will end up actually reducing the
185 unsigned Bytes = unsigned(End-Start);
213 const_iterator end() const { return Ranges.end(); } function in class:__anon15367::MemsetRanges
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| IntegerDivision.cpp | 216 // | end |
220 BasicBlock *End = SpecialCases->splitBasicBlock(Builder.GetInsertPoint(),
221 "udiv-end");
223 "udiv-loop-exit", F, End);
225 "udiv-do-while", F, End);
227 "udiv-preheader", F, End);
229 "udiv-bb1", F, End);
250 // ; br i1 %earlyRet, label %end, label %bb1
263 Builder.CreateCondBr(EarlyRet, End, BB1);
329 // ; br label %end
[all...] |
| /external/llvm/tools/llvm-objdump/ |
| llvm-objdump.cpp | 327 array_pod_sort(Symbols.begin(), Symbols.end());
340 std::sort(Rels.begin(), Rels.end(), RelocAddressLess);
374 std::vector<RelocationRef>::const_iterator rel_end = Rels.end();
379 // The end is either the section end or the beginning of the next symbol.
380 uint64_t End = (si == se - 1) ? SectSize : Symbols[si + 1].first;
382 if (Start == End)
393 for (Index = Start; Index < End; Index += Size) {
524 for (std::size_t addr = 0, end = Contents.size(); addr < end; addr += 16)
[all...] |
