HomeSort by relevance Sort by last modified time
    Searched defs:it (Results 476 - 500 of 1441) sorted by null

<<11121314151617181920>>

  /art/compiler/linker/
relative_patcher_test.h 222 auto it = map.find(ref); variable
223 if (it == map.end()) {
226 return std::pair<bool, uint32_t>(true, it->second);
  /art/runtime/base/
timing_logger.cc 98 auto it = histograms_.find(&dummy); local
99 if (it == histograms_.end()) {
105 histogram = *it;
124 // We don't expect DumpHistogram to be called often, so it is not performance critical.
variant_map.h 27 // A variant map is a heterogenous, type safe key->value map. It allows
30 // It provides the following interface in a nutshell:
40 // Since the key is strongly typed at compile-time, it is impossible to accidentally
73 // Allocate a unique counter value each time it's called.
228 // Lookup the value from the key. If it was not set in the map, return the default value.
237 // TODO: move to detail, or make it more generic like a ScopeGuard(function)
250 // Release the value from the key. If it was not set in the map, returns the default value.
251 // If the key was set, it is removed as a side effect.
298 auto&& it = GetKeyValueIterator(key); local
299 if (it != storage_map_.end())
430 auto&& it = GetKeyValueIterator(key); local
    [all...]
  /art/runtime/
fault_handler.cc 33 // Typically a signal handler should not need to deal with signals that occur within it.
37 // that it may not work. If the cause of the original SIGSEGV is a corrupted stack or other
52 // a. it completes successfully
53 // b. it crashes and a signal is raised.
60 // and write something to the log to tell the user that it happened.
151 // If malloc calls abort, it will be holding its lock.
152 // If the handler tries to call malloc, it will deadlock.
165 // We have handled a signal so it's time to return from the
175 // if it is.
191 // Release the fault manager so that it will remove the signal chain fo
285 auto it = std::find(generated_code_handlers_.begin(), generated_code_handlers_.end(), handler); local
    [all...]
transaction.cc 44 for (auto it : object_logs_) {
45 field_values_count += it.second.Size();
49 for (auto it : array_logs_) {
50 array_values_count += it.second.Size();
66 // We just keep the message of the first abort because it will cause the
208 for (auto it : object_logs_) {
209 it.second.Undo(it.first);
217 for (auto it : array_logs_) {
218 it.second.Undo(it.first)
331 auto it = field_values_.find(offset.Uint32Value()); local
485 auto it = array_values_.find(index); local
    [all...]
  /art/runtime/native/
dalvik_system_DexFile.cc 185 auto it = error_msgs.begin(); local
187 for ( ; it != itEnd; ++it) {
188 ThrowWrappedIOException("%s", it->c_str());
282 // Now create output array and copy the set into it.
286 auto it = descriptors.begin(); local
289 for (; it != it_end; it++, ++i) {
290 std::string descriptor(DescriptorToDot(*it));
331 // function. We have it here because GetStatus() should not be copyin
    [all...]
  /art/runtime/verifier/
register_line.cc 88 // precise than the subtype in vsrc so leave it for reference types. For primitive types
105 auto it = verifier->GetStringInitPcRegMap().find(dex_pc); local
106 if (it != verifier->GetStringInitPcRegMap().end()) {
107 it->second.insert(i);
  /bionic/libc/tools/zoneinfo/
ZoneCompactor.java 90 Iterator<String> it = links.keySet().iterator(); local
91 while (it.hasNext()) {
92 String from = it.next();
128 it = sortedOlsonIds.iterator();
129 while (it.hasNext()) {
130 String zoneName = it.next();
  /cts/suite/audio_quality/lib/src/task/
TaskCase.cpp 71 typename std::map<android::String8, T>::iterator it; local
72 it = map.find(name);
73 if (it != map.end()) {
86 typename std::map<android::String8, T>::iterator it; local
87 it = map.find(name);
88 if (it == map.end()) {
91 data = it->second;
99 typename std::map<android::String8, T>::iterator it; local
100 it = map.find(name);
101 if (it == map.end())
118 typename std::map<android::String8, T>::iterator it; local
    [all...]
  /device/moto/shamu/camera/QCamera2/HAL/
QCameraChannel.cpp 998 List<OfflineBuffer>::iterator it = mOfflineBuffers.begin(); local
    [all...]
QCameraMem.cpp 343 /* to make it page size aligned */
489 List<struct QCameraMemory::QCameraMemInfo>::iterator it; local
490 it = mPools[i].begin();
491 for( ; it != mPools[i].end() ; it++) {
492 QCameraMemory::deallocOneBuffer(*it);
530 List<struct QCameraMemory::QCameraMemInfo>::iterator it; local
531 it = mPools[streamType].begin();
532 for ( ; it != mPools[streamType].end() ; it++)
    [all...]
  /external/androidplot/AndroidPlot-Core/src/main/java/com/androidplot/xy/
XYLegendWidget.java 32 * This class is of no use outside of XYLegendWidget. It's just used to alphabetically sort
177 Iterator<RectF> it = tableModel.getIterator(widgetRect, seriesCount); local
186 // maxIndex is only used if it has been determined.
187 // if it is 0 then it could not be determined.
188 for (int i = 0; i < sfl.size() && it.hasNext(); i++) {
189 cellRect = it.next();
198 if(!it.hasNext()) {
201 cellRect = it.next();
  /external/apache-harmony/jdwp/src/test/java/org/apache/harmony/jpda/tests/framework/jdwp/
Frame.java 161 Iterator it = vars.iterator(); local
162 while (it.hasNext()) {
163 string += ((Variable) it.next()).toString();
  /external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/
Security2Test.java 46 Iterator it = provider.entrySet().iterator(); local
47 while (it.hasNext()) {
48 Map.Entry entry = (Map.Entry) it.next();
62 Iterator it = provider.entrySet().iterator(); local
63 while (it.hasNext()) {
64 Map.Entry entry = (Map.Entry) it.next();
86 Iterator it = allSupported.keySet().iterator(); local
87 while (it.hasNext()) {
88 String filterString = (String) it.next();
306 // Now add it
    [all...]
  /external/apache-http/src/org/apache/http/protocol/
BasicHttpProcessor.java 123 for (Iterator it = this.requestInterceptors.iterator();
124 it.hasNext(); ) {
125 Object request = it.next();
127 it.remove();
137 for (Iterator it = this.responseInterceptors.iterator();
138 it.hasNext(); ) {
139 Object request = it.next();
141 it.remove();
  /external/boringssl/src/tool/
digest.cc 79 // file descriptor to it. Returns true on sucess or prints an error to stderr
114 // It returns true on success or prints an error to stderr and returns false on
185 // format of the coreutils *sum utilities. It returns true on success or prints
216 // coreutils *sum utilities. It attempts to verify each hash by reading the
219 // It returns true if all files were verified and, if |args.strict|, no input
220 // lines had formatting errors. Otherwise it prints errors to stderr and
364 auto it = args.begin(); local
365 while (it != args.end()) {
366 const std::string &arg = *it;
371 it++
    [all...]
  /external/bouncycastle/bcpkix/src/main/java/org/bouncycastle/cms/
CMSSignedData.java 40 * Iterator it = c.iterator();
42 * while (it.hasNext())
44 * SignerInformation signer = (SignerInformation)it.next();
367 // for (Iterator it = signers.iterator(); it.hasNext();)
369 // SignerInformation signer = (SignerInformation)it.next();
455 Iterator it = signerInformationStore.getSigners().iterator(); local
456 while (it.hasNext())
458 SignerInformation signer = (SignerInformation)it.next();
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/
PKIXCertPathBuilderSpi.java 68 for (Iterator it = extPKIX.getAdditionalStores().iterator(); it.hasNext();)
70 paramsPKIXBldr.addCertificateStore((PKIXCertStore)it.next());
151 // If tbvCert is readily present in tbvPath, it indicates having run
264 Iterator it = issuers.iterator(); local
266 while (it.hasNext() && builderResult == null)
268 X509Certificate issuer = (X509Certificate) it.next();
  /external/clang/test/SemaCXX/
for-range-examples.cpp 30 T it, step; member in class:value_range_detail::value_range_step_iter
32 value_range_step_iter(const T &it, const T &step) : it(it), step(step) {}
33 T operator*() const { return it; }
34 bool operator!=(value_range_step_iter end) const { return it != end.it; }
35 value_range_step_iter &operator++() { it += step; return *this; }
40 T it, step, end_; member in class:value_range_detail::value_range_step
42 value_range_step(const T &it, const T &end, const T &step)
    [all...]
  /external/clang/tools/driver/
driver.cpp 10 // This is the entry point to the clang driver; it is a thin wrapper
236 // comparing it against DriverSuffixes in order.
269 auto it = ArgVector.begin(); local
270 if (it != ArgVector.end())
271 ++it;
272 ArgVector.insert(it, Flag);
284 auto it = ArgVector.begin(); local
285 if (it != ArgVector.end())
286 ++it;
288 ArgVector.insert(it, std::begin(arr), std::end(arr))
    [all...]
  /external/deqp/framework/common/
tcuRGBA.hpp 128 float it = 1.0f - t; local
131 (int)(it*(float)a.getRed() + t*(float)b.getRed() + 0.5f),
132 (int)(it*(float)a.getGreen() + t*(float)b.getGreen() + 0.5f),
133 (int)(it*(float)a.getBlue() + t*(float)b.getBlue() + 0.5f),
134 (int)(it*(float)a.getAlpha() + t*(float)b.getAlpha() + 0.5f));
  /external/drm_hwcomposer/
gl_compositor.cpp 43 for (typename std::vector<T>::iterator it = array.begin(); it != array.end();
44 ++it) {
45 if (!it->is_some()) {
46 return std::distance(array.begin(), it);
120 std::vector<GLComposition *>::iterator it = local
122 if (it != compositions.end()) {
123 compositions.erase(it);
168 for (std::vector<GLComposition *>::iterator it = priv_->compositions.end();
169 it != priv_->compositions.begin(); it = priv_->compositions.end())
    [all...]
  /external/eigen/Eigen/src/Core/products/
SelfadjointMatrixVector.h 64 // FIXME this copy is now handled outside product_selfadjoint_vector, so it could probably be removed.
65 // if the rhs is not sequentially stored in memory we copy it to a temporary buffer,
70 const Scalar* it = _rhs; local
71 for (Index i=0; i<size; ++i, it+=rhsIncr)
72 rhs[i] = *it;
  /external/google-breakpad/src/processor/
basic_source_line_resolver.cc 213 FileMap::const_iterator it = files_.find(line->source_file_id); local
214 if (it != files_.end()) {
292 // Create a frame info structure, and populate it with the rules from
minidump_processor_unittest.cc 131 // MDRawMiscInfo fed to it.
289 map<string, char *>::iterator it = memory_buffers_.find(module->code_file()); local
290 if (it != memory_buffers_.end()) {
291 delete [] it->second;
292 memory_buffers_.erase(it);
297 // MDRawSystemInfo fed to it.
309 // fed to it.
541 // Should have a single thread with a single frame in it.
615 // The memory contents don't really matter here, since it won't be used.

Completed in 829 milliseconds

<<11121314151617181920>>