| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/glslang/glslang/MachineIndependent/ |
| RemoveTree.cpp | 113 TRemoveTraverser it; local
115 root->traverse(&it);
|
| limits.cpp | 43 // "Within the body of the loop, the loop index is not statically assigned to nor is it used as the
134 TInductiveTraverser it(loopId, symbolTable);
139 body->traverse(&it);
141 if (it.bad)
142 error(it.badLoc, "inductive loop index modified", "limitations", "");
190 TIndexTraverser it(inductiveLoopIds);
192 index->traverse(&it);
194 if (it.bad)
195 error(it.badLoc, "Non-constant-index-expression", "limitations", "");
|
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/arm/ |
| itblock.s | 1 # All-true IT block macro.
15 .it \cond
|
| thumb2_it_bad.s | 16 it eq
21 it eq
|
| thumbv6k.s | 10 # do this explicitly so it's consistent for all object formats.
|
| udf.s | 15 it eq
20 it ne
|
| /toolchain/binutils/binutils-2.27/gas/testsuite/gas/m68k/ |
| p11673.s | 2 # with moveb and movew, but it is forbidden with movel.
|
| /external/webp/src/enc/ |
| analysis_enc.c | 240 static int MBAnalyzeBestIntra16Mode(VP8EncIterator* const it) {
246 VP8MakeLuma16Preds(it);
252 VP8CollectHistogram(it->yuv_in_ + Y_OFF_ENC,
253 it->yuv_p_ + VP8I16ModeOffsets[mode],
261 VP8SetIntra16Mode(it, best_mode);
265 static int FastMBAnalyze(VP8EncIterator* const it) {
268 const int q = (int)it->enc_->config_->quality;
273 VP8Mean16x4(it->yuv_in_ + Y_OFF_ENC + k * BPS, &dc[k]);
280 VP8SetIntra16Mode(it, 0); // DC16
283 VP8SetIntra4Mode(it, modes)
432 VP8EncIterator it; member in struct:__anon43737
[all...] |
| /frameworks/support/jetifier/jetifier/processor/src/main/kotlin/com/android/tools/build/jetifier/processor/ |
| Processor.kt | 107 pomRewriteRules = config.pomRewriteRules.map { it.getReversed() }.toSet(),
133 + it.from.groupId!!.replace(".", "[./\\\\]")
135 + it.from.artifactId
141 + it.to.groupId!!.replace(".", "[./\\\\]")
143 + it.to.artifactId
163 val inputLibraries = input.map { it.from }.toSet()
175 libraries.forEach { transformLibrary(it) }
198 .filter { copyUnmodifiedLibsAlso || it.wasChanged }
200 it.writeSelf()
210 .filter { it.wasChanged
[all...] |
| /art/runtime/jdwp/ |
| object_registry.cc | 111 // This object isn't in the registry yet, so add it.
133 for (auto it = object_to_entry_.lower_bound(identity_hash_code), end = object_to_entry_.end();
134 it != end && it->first == identity_hash_code; ++it) {
135 ObjectRegistryEntry* entry = it->second;
182 auto it = id_to_entry_.find(id); local
183 if (it == id_to_entry_.end()) {
187 ObjectRegistryEntry& entry = *it->second;
198 auto it = id_to_entry_.find(id) local
207 auto it = id_to_entry_.find(id); local
215 auto it = id_to_entry_.find(id); local
245 auto it = id_to_entry_.find(id); local
259 auto it = id_to_entry_.find(id); local
[all...] |
| /external/libchrome/base/metrics/ |
| persistent_sample_map_unittest.cc | 164 std::unique_ptr<SampleCountIterator> it = samples.Iterator(); local
170 it->Get(&min, &max, &count);
174 EXPECT_FALSE(it->GetBucketIndex(NULL));
176 it->Next();
177 it->Get(&min, &max, &count);
182 it->Next();
183 it->Get(&min, &max, &count);
188 it->Next();
189 EXPECT_TRUE(it->Done());
213 std::unique_ptr<SampleCountIterator> it = samples1.Iterator() local
243 std::unique_ptr<SampleCountIterator> it = samples.Iterator(); local
[all...] |
| /external/pdfium/core/fpdfapi/parser/ |
| cpdf_dictionary.cpp | 32 // Mark the object as deleted so that it will not be deleted again,
35 for (auto& it : m_Map) {
36 if (it.second && it.second->GetObjNum() == kInvalidObjNum)
37 it.second.release();
72 for (const auto& it : *this) {
73 if (!pdfium::ContainsKey(*pVisited, it.second.get())) {
75 if (auto obj = it.second->CloneNonCyclic(bDirect, &visited))
76 pCopy->m_Map.insert(std::make_pair(it.first, std::move(obj)));
83 auto it = m_Map.find(key) local
189 auto it = m_Map.find(key); local
199 auto it = m_Map.find(key); local
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| AbstractRealVector.java | 97 Iterator<Entry> it = sparseIterator(); local
99 while (it.hasNext() && (e = it.next()) != null) {
112 Iterator<Entry> it = sparseIterator(); local
114 while (it.hasNext() && (e = it.next()) != null) {
124 Iterator<Entry> it = sparseIterator(); local
126 while (it.hasNext() && (e = it.next()) != null) {
140 Iterator<Entry> it = sparseIterator() local
178 Iterator<Entry> it = sparseIterator(); local
200 Iterator<Entry> it = iterator(); local
212 Iterator<Entry> it = sparseIterator(); local
224 Iterator<Entry> it = sparseIterator(); local
235 Iterator<Entry> it = sparseIterator(); local
252 Iterator<Entry> it = iterator(); local
264 Iterator<Entry> it = iterator(); local
276 Iterator<Entry> it = iterator(); local
288 Iterator<Entry> it = iterator(); local
757 Iterator<Entry> it = iterator(); local
832 Iterator<Entry> it = (function.value(0) == 0) ? sparseIterator() : iterator(); local
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| CharsetRecog_mbcs.java | 94 // ASCII or ISO file? It's probably not our encoding,
95 // but is not incompatible with our encoding, so don't give it a zero.
168 * Get the next character (however many bytes it is) from the input data
174 * @param it The iteratedChar "struct" into which the returned char is placed.
179 abstract boolean nextChar(iteratedChar it, CharsetDetector det);
202 boolean nextChar(iteratedChar it, CharsetDetector det) {
203 it.error = false;
205 firstByte = it.charValue = it.nextByte(det);
214 int secondByte = it.nextByte(det)
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| CharsetRecog_mbcs.java | 93 // ASCII or ISO file? It's probably not our encoding,
94 // but is not incompatible with our encoding, so don't give it a zero.
167 * Get the next character (however many bytes it is) from the input data
173 * @param it The iteratedChar "struct" into which the returned char is placed.
178 abstract boolean nextChar(iteratedChar it, CharsetDetector det);
201 boolean nextChar(iteratedChar it, CharsetDetector det) {
202 it.error = false;
204 firstByte = it.charValue = it.nextByte(det);
213 int secondByte = it.nextByte(det)
[all...] |
| /external/webrtc/webrtc/video/ |
| send_statistics_proxy_unittest.cc | 54 for (std::map<uint32_t, VideoSendStream::StreamStats>::const_iterator it =
56 it != one.substreams.end(); ++it) {
58 corresponding_it = other.substreams.find(it->first);
60 const VideoSendStream::StreamStats& a = it->second;
101 for (std::vector<uint32_t>::const_iterator it = config_.rtp.ssrcs.begin();
102 it != config_.rtp.ssrcs.end();
103 ++it) {
104 const uint32_t ssrc = *it;
115 for (std::vector<uint32_t>::const_iterator it = config_.rtp.rtx.ssrcs.begin()
[all...] |
| /external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/ |
| XMPSerializerRDF.java | 7 // of the Adobe license agreement accompanying it.
133 * Calulates the padding according to the options and write it to the stream.
314 for (Iterator it = xmp.getRoot().iterateChildren(); it.hasNext(); )
316 XMPNode currSchema = (XMPNode) it.next();
363 for (Iterator it = xmp.getRoot().iterateChildren(); it.hasNext();)
365 XMPNode schema = (XMPNode) it.next();
371 for (Iterator it = xmp.getRoot().iterateChildren(); it.hasNext();
[all...] |
| /art/tools/veridex/ |
| resolver.cc | 33 // Class already exists, cache it and move on.
46 ClassDataItemIterator it(dex_file_, class_data);
47 for (; it.HasNextStaticField(); it.Next()) {
48 field_infos_[it.GetMemberIndex()] = it.DataPointer();
50 for (; it.HasNextInstanceField(); it.Next()) {
51 field_infos_[it.GetMemberIndex()] = it.DataPointer()
[all...] |
| /external/v8/src/arm64/ |
| instrument-arm64.cc | 100 // Set up the output stream. If datafile is non-NULL, use that file. If it
131 std::list<Counter*>::iterator it; local
132 for (it = counters_.begin(); it != counters_.end(); it++) {
133 delete *it;
158 std::list<Counter*>::const_iterator it; local
159 for (it = counters_.begin(); it != counters_.end(); it++)
170 std::list<Counter*>::const_iterator it; local
200 std::list<Counter*>::const_iterator it; local
218 std::list<Counter*>::iterator it; local
226 std::list<Counter*>::iterator it; local
[all...] |
| /art/libartbase/base/ |
| stl_util.h | 34 // For hash_[multi]set, it is important that this deletes behind the iterator
35 // because the hash_set may call the hash function on the iterator when it is
68 // in the case it's given a null pointer.
94 auto it = std::find(container.begin(), container.end(), value); local
95 DCHECK(it != container.end()); // Must exist.
96 return std::distance(container.begin(), it);
102 auto it = std::find(container.begin(), container.end(), value); local
103 DCHECK(it != container.end()); // Must exist.
104 container.erase(it);
110 auto it = std::find(container.begin(), container.end(), old_value) local
121 auto it = std::find(start, container.end(), value); local
[all...] |
| /art/test/137-cfi/ |
| cfi.cc | 71 for (Backtrace::const_iterator it = bt->begin(); it != bt->end(); ++it) {
72 if (BacktraceMap::IsValid(it->map)) {
73 LOG(INFO) << "Got " << it->func_name << ", looking for " << seq[cur_search_index];
74 if (it->func_name.find(seq[cur_search_index]) != std::string::npos) {
84 for (Backtrace::const_iterator it = bt->begin(); it != bt->end(); ++it) {
85 if (BacktraceMap::IsValid(it->map))
[all...] |
| /external/adhd/cras/src/tests/ |
| dbus_test.cc | 197 for (std::vector<Arg>::iterator it = args->begin(); it != args->end(); ++it) {
198 Arg &arg = *it;
236 for (std::vector<Arg>::iterator it = args->begin(); it != args->end(); ++it) {
237 Arg &arg = *it;
247 arg = *(++it);
370 // we generated on our server side, and if so, remove it from the list o
608 std::vector<DBusWatch *>::iterator it = local
638 std::vector<DBusTimeout *>::iterator it = local
[all...] |
| /external/eigen/unsupported/Eigen/CXX11/src/Tensor/ |
| TensorDeviceSycl.h | 25 /// If a non-read-only pointer is needed to be accessed on the host we should manually deallocate it.
48 auto it = buffer_map.find(p); local
49 if (it != buffer_map.end()) {
50 buffer_map.erase(it);
55 std::map<const void *, std::shared_ptr<void>>::iterator it=buffer_map.begin(); local
56 while (it!=buffer_map.end()) {
57 auto p=it->first;
58 buffer_map.erase(it);
60 it=buffer_map.begin();
66 /// the buffer in the buffer_map. If found it gets the accessor from it, if not
103 auto it = buffer_map.find(src); local
[all...] |
| /external/google-breakpad/src/testing/src/ |
| gmock-spec-builders.cc | 103 for (ExpectationSet::const_iterator it = immediate_prerequisites_.begin();
104 it != immediate_prerequisites_.end(); ++it) {
105 ExpectationBase* const prerequisite = it->expectation_base().get();
118 for (ExpectationSet::const_iterator it = immediate_prerequisites_.begin();
119 it != immediate_prerequisites_.end(); ++it) {
120 if (!(it->expectation_base()->IsSatisfied()) ||
121 !(it->expectation_base()->AllPrerequisitesAreSatisfied()))
131 for (ExpectationSet::const_iterator it = immediate_prerequisites_.begin()
[all...] |
| /external/googletest/googlemock/src/ |
| gmock-spec-builders.cc | 102 for (ExpectationSet::const_iterator it = immediate_prerequisites_.begin();
103 it != immediate_prerequisites_.end(); ++it) {
104 ExpectationBase* const prerequisite = it->expectation_base().get();
117 for (ExpectationSet::const_iterator it = immediate_prerequisites_.begin();
118 it != immediate_prerequisites_.end(); ++it) {
119 if (!(it->expectation_base()->IsSatisfied()) ||
120 !(it->expectation_base()->AllPrerequisitesAreSatisfied()))
130 for (ExpectationSet::const_iterator it = immediate_prerequisites_.begin()
[all...] |
