| /external/llvm/unittests/Support/ |
| IteratorTest.cpp | 29 test_iterator Begin, End;
30 Begin = V.begin();
33 test_iterator I = Begin;
37 EXPECT_EQ(I, Begin + i);
38 EXPECT_EQ(I, std::next(Begin, i));
39 test_iterator J = Begin;
42 EXPECT_EQ(*V[i], Begin[i]);
47 EXPECT_GE(I, Begin);
48 EXPECT_LE(Begin, I)
[all...] |
| /external/e2fsprogs/ |
| .missing-copyright | 3 find . -type f \! -name \*~ \! -exec grep -q Begin-Header \{\} \; -print \
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/algorithm/string/detail/ |
| finder.hpp | 19 #include <boost/range/begin.hpp>
33 Returns a pair <begin,end> marking the subsequence in the sequence.
44 m_Search(::boost::begin(Search), ::boost::end(Search)), m_Comp(Comp) {}
55 ForwardIteratorT Begin,
62 for(input_iterator_type OuterIt=Begin;
71 search_iterator_type SubstrIt=m_Search.begin();
97 Returns a pair <begin,end> marking the subsequence in the sequence.
111 m_Search(::boost::begin(Search), ::boost::end(Search)), m_Comp(Comp) {}
122 ForwardIteratorT Begin,
133 return findit( Begin, End, category() )
[all...] |
| sequence.hpp | 17 #include <boost/range/begin.hpp>
32 ForwardIteratorT Begin,
35 Input.insert( At, Begin, End );
44 ::boost::algorithm::detail::insert( Input, At, ::boost::begin(Insert), ::boost::end(Insert) );
74 ForwardIteratorT Begin,
78 ForwardIteratorT InsertIt=Begin;
110 ForwardIteratorT Begin,
114 if ( Begin!=End )
118 Input.insert( At, Begin, End );
122 Input.insert( Input.begin(), Begin, End )
[all...] |
| /external/clang/include/clang/Analysis/Support/ |
| BumpVector.h | 59 T *Begin, *End, *Capacity;
63 : Begin(nullptr), End(nullptr), Capacity(nullptr) {
70 destroy_range(Begin, End);
89 iterator begin() { return Begin; } function in class:clang::BumpVector
90 const_iterator begin() const { return Begin; } function in class:clang::BumpVector
97 reverse_iterator rend() { return reverse_iterator(begin()); }
98 const_reverse_iterator rend() const { return const_reverse_iterator(begin());}
100 bool empty() const { return Begin == End;
[all...] |
| /external/llvm/include/llvm/ADT/ |
| StringExtras.h | 169 inline std::string join_impl(IteratorT Begin, IteratorT End,
172 if (Begin == End)
175 S += (*Begin);
176 while (++Begin != End) {
178 S += (*Begin);
184 inline std::string join_impl(IteratorT Begin, IteratorT End,
187 if (Begin == End)
190 size_t Len = (std::distance(Begin, End) - 1) * Separator.size();
191 for (IteratorT I = Begin; I != End; ++I)
192 Len += (*Begin).size()
[all...] |
| /external/clang/include/clang/AST/ |
| ASTVector.h | 35 T *Begin, *End;
48 ASTVector() : Begin(nullptr), End(nullptr), Capacity(nullptr, false) {}
50 ASTVector(ASTVector &&O) : Begin(O.Begin), End(O.End), Capacity(O.Capacity) {
51 O.Begin = O.End = nullptr;
57 : Begin(nullptr), End(nullptr), Capacity(nullptr, false) {
64 swap(Begin, O.Begin);
73 destroy_range(Begin, End);
92 iterator begin() { return Begin; function in class:clang::ASTVector
93 const_iterator begin() const { return Begin; } function in class:clang::ASTVector
[all...] |
| /external/llvm/include/llvm/Support/ |
| BranchProbability.h | 63 static void normalizeProbabilities(ProbabilityIter Begin,
69 static void normalizeEdgeWeights(WeightListIter Begin, WeightListIter End);
181 void BranchProbability::normalizeProbabilities(ProbabilityIter Begin,
183 if (Begin == End)
187 uint64_t Sum = std::accumulate(Begin, End, uint64_t(0),
204 std::replace_if(Begin, End,
213 BranchProbability BP(1, std::distance(Begin, End));
214 std::fill(Begin, End, BP);
218 for (auto I = Begin; I != End; ++I)
223 void BranchProbability::normalizeEdgeWeights(WeightListIter Begin,
[all...] |
| /external/clang/test/CodeGenCXX/ |
| PR24289.cpp | 6 const T *Begin;
10 : Begin(B), Size(S) {}
|
| /external/llvm/tools/llvm-pdbdump/ |
| LinePrinter.h | 41 void SetFilters(std::list<Regex> &List, Iter Begin, Iter End) {
43 for (; Begin != End; ++Begin)
44 List.emplace_back(StringRef(*Begin));
|
| /art/runtime/gc/collector/ |
| immune_spaces_test.cc | 33 DummyOatFile(uint8_t* begin, uint8_t* end) : OatFile("Location", /*is_executable*/ false) {
34 begin_ = begin;
109 std::unique_ptr<DummyOatFile> oat_file(new DummyOatFile(oat_map->Begin(), oat_map->End()));
112 new (map->Begin()) ImageHeader(
113 /*image_begin*/PointerToLowMemUInt32(map->Begin()),
116 /*image_roots*/PointerToLowMemUInt32(map->Begin()) + 1,
153 return map->Begin();
164 DummySpace(uint8_t* begin, uint8_t* end)
167 begin,
200 EXPECT_EQ(reinterpret_cast<uint8_t*>(spaces.GetLargestImmuneRegion().Begin()), a.Begin())
[all...] |
| immune_spaces.cc | 45 uintptr_t space_begin = reinterpret_cast<uintptr_t>(space->Begin());
57 intervals.push_back(Interval(reinterpret_cast<uintptr_t>(image_oat_file->Begin()),
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
71 const uintptr_t begin = std::get<0>(interval); local
74 VLOG(collector) << "Interval " << reinterpret_cast<const void*>(begin) << "-"
76 DCHECK_GE(end, begin);
77 DCHECK_GE(begin, cur_end);
80 if (begin != cur_end) {
85 cur_begin = begin;
[all...] |
| /art/runtime/gc/accounting/ |
| read_barrier_table.h | 42 CHECK(mem_map != nullptr && mem_map->Begin() != nullptr)
47 uint8_t* entry_start = EntryFromAddr(space->Begin());
70 memset(mem_map_->Begin(), kSetEntryValue, mem_map_->Size());
73 for (uint32_t* p = reinterpret_cast<uint32_t*>(mem_map_->Begin());
91 uint8_t* entry_addr = mem_map_->Begin() + reinterpret_cast<uintptr_t>(heap_addr) / kRegionSize;
107 uint8_t* begin = mem_map_->Begin(); local
109 return entry_addr >= begin && entry_addr < end;
|
| bitmap.cc | 34 : mem_map_(mem_map), bitmap_begin_(reinterpret_cast<uintptr_t*>(mem_map->Begin())),
74 std::copy(source_bitmap->Begin(),
75 source_bitmap->Begin() + BitmapSize() / kBitsPerBitmapWord, Begin());
90 MemMap* mem_map, uintptr_t begin, size_t num_bits) {
91 return new MemoryRangeBitmap(mem_map, begin, num_bits);
|
| /external/llvm/include/llvm/MC/ |
| MCSectionCOFF.h | 47 MCSymbol *Begin)
48 : MCSection(SV_COFF, K, Begin), SectionName(Section),
|
| MCWinEH.h | 34 const MCSymbol *Begin;
49 : Begin(nullptr), End(nullptr), ExceptionHandler(nullptr),
54 : Begin(BeginFuncEHLabel), End(nullptr), ExceptionHandler(nullptr),
60 : Begin(BeginFuncEHLabel), End(nullptr), ExceptionHandler(nullptr),
|
| /toolchain/binutils/binutils-2.25/binutils/testsuite/binutils-all/ |
| testranges-ia64.d | 9 Offset Begin End
|
| testranges.d | 9 Offset Begin End
|
| /external/llvm/lib/CodeGen/ |
| MachineLoopInfo.cpp | 52 MachineFunction::iterator Begin = TopMBB->getParent()->begin();
53 if (TopMBB != Begin) {
57 if (TopMBB == Begin) break;
|
| SlotIndexes.cpp | 72 for (MachineFunction::iterator mbbItr = mf->begin(), mbbEnd = mf->end();
79 for (MachineBasicBlock::iterator miItr = mbb->begin(), miEnd = mbb->end();
103 std::sort(idx2MBBMap.begin(), idx2MBBMap.end(), Idx2MBBCompare());
118 for (IndexList::iterator I = indexList.begin(), E = indexList.end();
147 MachineBasicBlock::iterator Begin,
153 while (Begin != MBB->begin() && !hasIndex(Begin))
154 --Begin;
158 bool includeStart = (Begin == MBB->begin())
[all...] |
| /external/clang/lib/Sema/ |
| SemaFixItUtils.cpp | 60 const SourceLocation Begin = FullExpr->getSourceRange().getBegin();
99 S, Begin, VK_LValue);
110 CharSourceRange::getTokenRange(Begin, Begin)));
113 Hints.push_back(FixItHint::CreateInsertion(Begin, "*("));
116 Hints.push_back(FixItHint::CreateInsertion(Begin, "*"));
137 S, Begin, VK_RValue);
144 CharSourceRange::getTokenRange(Begin, Begin)));
147 Hints.push_back(FixItHint::CreateInsertion(Begin, "&("))
[all...] |
| /external/llvm/lib/MC/ |
| StringTableBuilder.cpp | 33 static void multikey_qsort(StringPair **Begin, StringPair **End, int Pos) {
35 if (End - Begin <= 1)
38 // Partition items. Items in [Begin, P) are greater than the pivot,
40 int Pivot = charTailAt(*Begin, Pos);
41 StringPair **P = Begin;
43 for (StringPair **R = Begin + 1; R < Q;) {
53 multikey_qsort(Begin, P, Pos);
57 Begin = P;
|
| MCSection.cpp | 22 MCSection::MCSection(SectionVariant V, SectionKind K, MCSymbol *Begin)
23 : Begin(Begin), BundleGroupBeforeFirstInst(false), HasInstructions(false),
62 std::lower_bound(SubsectionFragmentMap.begin(),
94 for (auto it = begin(), ie = end(); it != ie; ++it) {
95 if (it != begin())
103 MCSection::iterator MCSection::begin() { return Fragments.begin(); } function in class:MCSection
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DebugLocEntry.h | 26 /// Begin and end symbols for the address range that this location is valid.
27 const MCSymbol *Begin;
88 : Begin(B), End(E) {
97 if (Begin == Next.Begin) {
115 if ((End == Next.Begin && Values == Next.Values)) {
122 const MCSymbol *getBeginSym() const { return Begin; }
126 Values.append(Vals.begin(), Vals.end());
128 assert(std::all_of(Values.begin(), Values.end(), [](DebugLocEntry::Value V){
136 std::sort(Values.begin(), Values.end())
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| FaultMaps.h | 176 const uint8_t *Begin = P + FunctionFaultInfosOffset +
178 return FunctionFaultInfoAccessor(Begin, E);
185 const uint8_t *Begin = P + MySize;
186 assert(Begin < E && "out of bounds!");
187 return FunctionInfoAccessor(Begin, E);
191 explicit FaultMapParser(const uint8_t *Begin, const uint8_t *End)
192 : P(Begin), E(End) {}
205 const uint8_t *Begin = P + FunctionInfosOffset;
206 return FunctionInfoAccessor(Begin, E);
|
