Home
last modified time | relevance | path

Searched refs:begin (Results 51 - 75 of 5036) sorted by relevance

12345678910>>...202

/third_party/skia/src/core/
H A DSkRecordOpts.cpp19 // - a bool onMatch(SkRceord*, Match*, int begin, int end) method,
24 // record, and [begin,end) span of the commands that matched.
29 int begin, end = 0; in apply() local
31 while (match.search(record, &begin, &end)) { in apply()
32 changed |= pass->onMatch(record, &match, begin, end); in apply()
46 bool onMatch(SkRecord* record, Match* pattern, int begin, int end) { in multiple_set_matrices()
47 record->replace<NoOp>(begin); // first SetMatrix in multiple_set_matrices()
64 bool onMatch(SkRecord* record, Pattern* pattern, int begin, int end) {
65 record->replace<NoOp>(begin); // first SetMatrix
83 bool onMatch(SkRecord* record, Match*, int begin, in
[all...]
/third_party/skia/third_party/externals/spirv-tools/test/opt/loop_optimizations/
H A Dpeeling.cpp124 Function& f = *module->begin(); in TEST_F()
133 InstructionBuilder builder(context.get(), &*f.begin()); in TEST_F()
138 LoopPeeling peel(&*ld.begin(), loop_count); in TEST_F()
490 Function& f = *module->begin(); in TEST_F()
495 InstructionBuilder builder(context.get(), &*f.begin()); in TEST_F()
499 LoopPeeling peel(&*ld.begin(), ten_cst); in TEST_F()
544 Function& f = *module->begin(); in TEST_F()
549 InstructionBuilder builder(context.get(), &*f.begin()); in TEST_F()
553 LoopPeeling peel(&*ld.begin(), ten_cst); in TEST_F()
600 Function& f = *module->begin(); in TEST_F()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/opt/loop_optimizations/
H A Dpeeling.cpp124 Function& f = *module->begin(); in TEST_F()
133 InstructionBuilder builder(context.get(), &*f.begin()); in TEST_F()
138 LoopPeeling peel(&*ld.begin(), loop_count); in TEST_F()
490 Function& f = *module->begin(); in TEST_F()
495 InstructionBuilder builder(context.get(), &*f.begin()); in TEST_F()
499 LoopPeeling peel(&*ld.begin(), ten_cst); in TEST_F()
544 Function& f = *module->begin(); in TEST_F()
549 InstructionBuilder builder(context.get(), &*f.begin()); in TEST_F()
553 LoopPeeling peel(&*ld.begin(), ten_cst); in TEST_F()
600 Function& f = *module->begin(); in TEST_F()
[all...]
/third_party/spirv-tools/test/opt/loop_optimizations/
H A Dpeeling.cpp123 Function& f = *module->begin(); in TEST_F()
132 InstructionBuilder builder(context.get(), &*f.begin()); in TEST_F()
137 LoopPeeling peel(&*ld.begin(), loop_count); in TEST_F()
489 Function& f = *module->begin(); in TEST_F()
494 InstructionBuilder builder(context.get(), &*f.begin()); in TEST_F()
498 LoopPeeling peel(&*ld.begin(), ten_cst); in TEST_F()
543 Function& f = *module->begin(); in TEST_F()
548 InstructionBuilder builder(context.get(), &*f.begin()); in TEST_F()
552 LoopPeeling peel(&*ld.begin(), ten_cst); in TEST_F()
599 Function& f = *module->begin(); in TEST_F()
[all...]
/third_party/libphonenumber/tools/cpp/src/cpp-build/
H A Dgenerate_geocoding_data.cc177 vector<char>::iterator begin, end, sep; in ParsePrefixes() local
181 begin = buffer.begin(); in ParsePrefixes()
182 end = std::find(begin, buffer.end(), '\0'); in ParsePrefixes()
183 if (end == begin) { in ParsePrefixes()
193 for (; begin != end && std::isspace(*begin); ++begin) {} in ParsePrefixes()
194 for (; end != begin && std::isspace(*(end - 1)); --end) {} in ParsePrefixes()
195 if (begin in ParsePrefixes()
511 string::const_iterator begin = input.begin(), end = begin; ReplaceAll() local
[all...]
/third_party/skia/third_party/externals/tint/src/reader/spirv/
H A Dparser_impl_test.cc137 EXPECT_EQ(7u, s5.range.begin.line); in TEST_F()
138 EXPECT_EQ(0u, s5.range.begin.column); in TEST_F()
140 EXPECT_EQ(8u, s60.range.begin.line); in TEST_F()
141 EXPECT_EQ(0u, s60.range.begin.column); in TEST_F()
143 EXPECT_EQ(10u, s1.range.begin.line); in TEST_F()
144 EXPECT_EQ(0u, s1.range.begin.column); in TEST_F()
170 EXPECT_EQ(42u, s5.range.begin.line); in TEST_F()
171 EXPECT_EQ(53u, s5.range.begin.column); in TEST_F()
173 EXPECT_EQ(42u, s60.range.begin.line); in TEST_F()
174 EXPECT_EQ(53u, s60.range.begin in TEST_F()
[all...]
/third_party/gn/src/gn/
H A Dimmutable_vector_unittest.cc23 EXPECT_TRUE(vec1.begin()); in TEST()
25 EXPECT_NE(vec1.begin(), vec1.end()); in TEST()
26 EXPECT_EQ(vec1.begin() + 2, vec1.end()); in TEST()
39 EXPECT_NE(vec2.begin(), &input[0]); in TEST()
63 EXPECT_NE(vec2.begin(), vec3.begin()); in TEST()
65 EXPECT_TRUE(std::equal(vec2.begin(), vec2.end(), vec3.begin(), vec3.end())); in TEST()
76 EXPECT_EQ(vec1.begin(), view1.begin()); in TEST()
[all...]
/third_party/json/tests/src/
H A Dunit-ordered_map.cpp22 ordered_map<std::string, std::string> om(m.begin(), m.end());
29 ordered_map<std::string, std::string> om(m.begin(), m.end());
39 ordered_map<std::string, std::string> om(m.begin(), m.end());
72 ordered_map<std::string, std::string> om(m.begin(), m.end());
114 auto it = om.begin();
132 auto it = om.begin();
150 auto it = om.begin();
166 auto it = om.begin();
177 CHECK(om.begin()->first == "eins");
178 CHECK(std::next(om.begin(),
[all...]
H A Dunit-deserialization.cpp489 CHECK(json::parse(std::begin(v), std::end(v)) == json(true));
490 CHECK(json::accept(std::begin(v), std::end(v)));
493 CHECK(json::sax_parse(std::begin(v), std::end(v), &l));
502 CHECK(json::parse(std::begin(v), std::end(v)) == json(true));
503 CHECK(json::accept(std::begin(v), std::end(v)));
506 CHECK(json::sax_parse(std::begin(v), std::end(v), &l));
514 CHECK(json::parse(std::begin(v), std::end(v)) == json(true));
515 CHECK(json::accept(std::begin(v), std::end(v)));
518 CHECK(json::sax_parse(std::begin(v), std::end(v), &l));
526 CHECK(json::parse(std::begin(
[all...]
/third_party/gn/src/base/strings/
H A Dstring_number_conversions.cc140 static bool Invoke(const_iterator begin, in Invoke() argument
145 while (begin != end && LocalIsWhitespace(*begin)) { in Invoke()
147 ++begin; in Invoke()
150 if (begin != end && *begin == '-') { in Invoke()
154 } else if (!Negative::Invoke(begin + 1, end, output)) { in Invoke()
158 if (begin != end && *begin == '+') { in Invoke()
159 ++begin; in Invoke()
178 Invoke(const_iterator begin, const_iterator end, typename traits::value_type* output) Invoke() argument
[all...]
/third_party/skia/third_party/externals/tint/src/
H A Dsource.cc47 if (rng.begin.line) { in operator <<()
48 out << rng.begin.line << ":"; in operator <<()
49 if (rng.begin.column) { in operator <<()
50 out << rng.begin.column; in operator <<()
62 for (size_t line = rng.begin.line; line <= rng.end.line; line++) { in operator <<()
70 if (line == rng.begin.line && line == rng.end.line) { in operator <<()
72 repeat(' ', rng.begin.column - 1); in operator <<()
73 repeat('^', std::max<size_t>(rng.end.column - rng.begin.column, 1)); in operator <<()
74 } else if (line == rng.begin.line) { in operator <<()
76 repeat(' ', rng.begin in operator <<()
[all...]
H A Dsource.h92 /// Range holds a Location interval described by [begin, end).
101 : begin(loc), end(loc) {} in Range()
107 : begin(b), end(e) {} in Range()
111 /// @returns a Range with a #begin and #end column shifted by `n`
113 return Range{{begin.line, begin.column + n}, {end.line, end.column + n}}; in operator +()
120 return begin == rhs.begin && end == rhs.end; in operator ==()
129 Location begin; member in tint::Source::Range
161 /// @returns a Source that points to the begin rang
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/random/internal/
H A Dnonsecure_base.h99 void generate(RandomAccessIterator begin, RandomAccessIterator end) { in generate()
100 if (begin != end) { in generate()
101 // begin, end must be random access iterators assignable from uint32_t. in generate()
103 std::integral_constant<bool, sizeof(*begin) == sizeof(uint32_t)>{}, in generate()
104 begin, end); in generate()
112 RandomAccessIterator begin, RandomAccessIterator end) { in generate_impl()
113 auto buffer = absl::MakeSpan(begin, end); in generate_impl()
123 RandomAccessIterator begin, RandomAccessIterator end) { in generate_impl()
124 const size_t n = std::distance(begin, end); in generate_impl()
126 RandenPool<uint32_t>::Fill(absl::MakeSpan(data.begin(), dat in generate_impl()
127 std::copy(std::begin(data), std::end(data), begin); generate_impl() local
[all...]
/third_party/skia/third_party/externals/piex/src/binary_parse/
H A Dcached_paged_byte_array.cc34 const unsigned char** begin, in getPage()
41 *begin = cached_pages_[cache_index].begin; in getPage()
46 cached_pages_.erase(cached_pages_.begin() + in getPage()
50 paged_byte_array_->getPage(page_index, begin, end, page); in getPage()
54 cached_pages_.erase(cached_pages_.begin()); in getPage()
62 cache_page.begin = *begin; in getPage()
33 getPage(size_t page_index, const unsigned char** begin, const unsigned char** end, PagedByteArray::PagePtr* page) const getPage() argument
/third_party/vk-gl-cts/framework/delibs/decpp/
H A DdePoolString.cpp35 std::copy(begin(), end(), str.begin()); in toString()
44 std::copy(str, str+len, begin()+oldEnd); in append()
52 std::copy(str.begin(), str.end(), begin()+oldEnd); in append()
60 std::copy(str.begin(), str.end(), begin()+oldEnd); in append()
65 for (PoolString::ConstIterator i = string.begin(); i != string.end(); i++) in operator <<()
/third_party/node/deps/v8/src/base/
H A Dregion-allocator.cc30 CHECK_LT(begin(), end()); in RegionAllocator()
33 CHECK(IsAligned(begin(), page_size_)); in RegionAllocator()
92 if (on_split_) on_split_(region->begin(), new_size); in Split()
98 new Region(region->begin() + new_size, region->size() - new_size, state); in Split()
118 DCHECK_EQ(prev->end(), next->begin()); in Merge()
120 if (on_merge_) on_merge_(prev->begin(), prev->size() + next->size()); in Merge()
141 DCHECK(IsAligned(region->begin(), page_size_)); in AllocateRegion()
147 return region->begin(); in AllocateRegion()
159 Address address = begin() + random_offset; in AllocateRegion()
191 if (region->begin() ! in AllocateRegionAt()
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/
H A Dunordered_set_modifiers_test.h37 TypeParam m(values.begin(), values.end()); in TYPED_TEST_P()
73 m.insert(values.begin(), values.end()); in TYPED_TEST_P()
97 values.insert(values.end(), base_values.begin(), base_values.end()); in TYPED_TEST_P()
102 m.insert(values.begin(), values.end()); in TYPED_TEST_P()
141 -> IfNotVoid<decltype(m->erase(m->begin()))> {
142 return m->erase(m->begin());
146 auto it = m->begin(); in operator ()()
157 TypeParam m(values.begin(), values.end()); in TYPED_TEST_P()
161 if (val != *m.begin()) values2.push_back(val); in TYPED_TEST_P()
164 EXPECT_EQ(1, std::count(values2.begin(), values in TYPED_TEST_P()
[all...]
/third_party/spirv-tools/source/opt/
H A Dfunction.h67 inline void AddBasicBlocks(T begin, T end, iterator ip);
108 iterator begin() { return iterator(&blocks_, blocks_.begin()); } in begin() function in spvtools::opt::Function
110 const_iterator begin() const { return cbegin(); } in begin() function in spvtools::opt::Function
121 return std::find_if(begin(), end(), [bb_id](const BasicBlock& it_bb) { in FindBlock()
182 bool IsDeclaration() { return begin() == end(); } in IsDeclaration()
189 // range |{begin,end}|. The range must contain every basic block in the
192 void ReorderBasicBlocks(It begin, It end);
195 bool ContainsAllBlocksInTheFunction(It begin, It end);
244 blocks_.erase(std::find(std::begin(blocks in MoveBasicBlockToAfter()
279 ReorderBasicBlocks(It begin, It end) ReorderBasicBlocks() argument
294 ContainsAllBlocksInTheFunction(It begin, It end) ContainsAllBlocksInTheFunction() argument
[all...]
H A Ddominator_tree.h50 iterator begin() { return children_.begin(); } in begin() function
52 const_iterator begin() const { return cbegin(); } in begin() function
54 const_iterator cbegin() const { return children_.begin(); } in cbegin()
66 post_iterator post_begin() { return post_iterator::begin(this); } in post_begin()
71 return const_post_iterator::begin(this); in post_cbegin()
113 iterator begin() { return ++iterator(GetRoot()); } in begin() function in spvtools::opt::DominatorTree
115 const_iterator begin() const { return cbegin(); } in begin() function in spvtools::opt::DominatorTree
122 post_iterator post_begin() { return post_iterator::begin(GetRoot()); } in post_begin()
127 return const_post_iterator::begin(GetRoo in post_cbegin()
[all...]
/third_party/spirv-tools/test/util/
H A Dsmall_vector_test.cpp32 EXPECT_EQ(vec.begin(), vec.end()); in TEST()
61 SmallVector<uint32_t, 6> vec(result.begin(), result.end()); in TEST()
212 for (SmallVector<uint32_t, 2>::iterator it = vec.begin(); it != vec.end(); in TEST()
226 for (SmallVector<uint32_t, 6>::iterator it = vec.begin(); it != vec.end(); in TEST()
237 for (SmallVector<uint32_t, 6>::iterator it = vec.begin(); it != vec.end(); in TEST()
245 for (SmallVector<uint32_t, 6>::iterator it = vec.begin(); it != vec.end(); in TEST()
256 for (SmallVector<uint32_t, 2>::iterator it = vec.begin(); it != vec.end(); in TEST()
264 for (SmallVector<uint32_t, 2>::iterator it = vec.begin(); it != vec.end(); in TEST()
275 for (SmallVector<uint32_t, 2>::iterator it = vec.begin(); it != vec.end(); in TEST()
287 vec.erase(vec.begin()); in TEST()
[all...]
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Ddominator_tree.h50 iterator begin() { return children_.begin(); } in begin() function
52 const_iterator begin() const { return cbegin(); } in begin() function
54 const_iterator cbegin() const { return children_.begin(); } in cbegin()
66 post_iterator post_begin() { return post_iterator::begin(this); } in post_begin()
71 return const_post_iterator::begin(this); in post_cbegin()
113 iterator begin() { return ++iterator(GetRoot()); } in begin() function in spvtools::opt::DominatorTree
115 const_iterator begin() const { return cbegin(); } in begin() function in spvtools::opt::DominatorTree
122 post_iterator post_begin() { return post_iterator::begin(GetRoot()); } in post_begin()
127 return const_post_iterator::begin(GetRoo in post_cbegin()
[all...]
H A Dregister_pressure.cpp143 MakeFilterIteratorRange(succ_live_inout->live_in_.begin(), in ComputePartialLiveness()
145 live_inout->live_out_.insert(filter.begin(), filter.end()); in ComputePartialLiveness()
175 loop.GetBlocks().begin(), loop.GetBlocks().end(), in DoLoopLivenessUnification()
188 MakeFilterIteratorRange(header_live_inout->live_in_.begin(), in DoLoopLivenessUnification()
196 live_inout->live_in_.insert(live_loop.begin(), live_loop.end()); in DoLoopLivenessUnification()
197 live_inout->live_out_.insert(live_loop.begin(), live_loop.end()); in DoLoopLivenessUnification()
203 live_inout->live_in_.insert(live_loop.begin(), live_loop.end()); in DoLoopLivenessUnification()
204 live_inout->live_out_.insert(live_loop.begin(), live_loop.end()); in DoLoopLivenessUnification()
300 loop_reg_pressure->live_out_.insert(live_inout->live_in_.begin(), in ComputeLoopRegisterPressure()
349 sim_result->live_in_.insert(l2_header_live_inout->live_in_.begin(), in SimulateFusion()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Ddominator_tree.h50 iterator begin() { return children_.begin(); } in begin() function
52 const_iterator begin() const { return cbegin(); } in begin() function
54 const_iterator cbegin() const { return children_.begin(); } in cbegin()
66 post_iterator post_begin() { return post_iterator::begin(this); } in post_begin()
71 return const_post_iterator::begin(this); in post_cbegin()
113 iterator begin() { return ++iterator(GetRoot()); } in begin() function in spvtools::opt::DominatorTree
115 const_iterator begin() const { return cbegin(); } in begin() function in spvtools::opt::DominatorTree
122 post_iterator post_begin() { return post_iterator::begin(GetRoot()); } in post_begin()
127 return const_post_iterator::begin(GetRoo in post_cbegin()
[all...]
/third_party/node/deps/v8/src/wasm/
H A Dwasm-code-manager.cc65 DCHECK(above == regions_.end() || above->begin() >= new_region.end()); in Merge()
68 if (above != regions_.end() && new_region.end() == above->begin()) { in Merge()
69 base::AddressRegion merged_region{new_region.begin(), in Merge()
73 if (above != regions_.begin()) { in Merge()
76 if (below->end() == new_region.begin()) { in Merge()
77 merged_region = {below->begin(), below->size() + merged_region.size()}; in Merge()
87 if (above == regions_.begin()) { in Merge()
95 DCHECK(above == regions_.end() || below->end() < above->begin()); in Merge()
98 if (below->end() == new_region.begin()) { in Merge()
99 base::AddressRegion merged_region{below->begin(), in Merge()
831 Address begin = RoundDown(region.begin(), commit_page_size); MakeWritable() local
[all...]
/third_party/libsnd/src/
H A Dogg.c409 { sf_count_t begin, end, original_end, chunk_size, ret ; in ogg_sync_last_page_before() local
416 original_end = end = begin = offset ; in ogg_sync_last_page_before()
420 { begin = SF_MAX (begin - chunk_size, (sf_count_t) 0) ; in ogg_sync_last_page_before()
421 position = ogg_sync_fseek (psf, begin, SEEK_SET) ; in ogg_sync_last_page_before()
441 if ((left_link || !begin) && offset < 0) in ogg_sync_last_page_before()
447 end = SF_MIN (begin + OGG_PAGE_SIZE_MAX - 1, original_end) ; in ogg_sync_last_page_before()
458 sf_count_t begin, sf_count_t end, uint64_t gp_rate) in ogg_stream_seek_page_search()
476 best = best_start = begin ; in ogg_stream_seek_page_search()
486 d2 = d1 = d0 = end - begin ; in ogg_stream_seek_page_search()
456 ogg_stream_seek_page_search(SF_PRIVATE *psf, OGG_PRIVATE *odata, uint64_t target_gp, uint64_t pcm_start, uint64_t pcm_end, uint64_t *best_gp, sf_count_t begin, sf_count_t end, uint64_t gp_rate) ogg_stream_seek_page_search() argument
[all...]

Completed in 17 milliseconds

12345678910>>...202