| /external/javassist/src/main/javassist/bytecode/ |
| ClassFile.java | 388 * have the same signature. If Y provides a method m(), X must provide it
576 * It does not check field duplication.
588 ListIterator it = fields.listIterator(0); local
589 while (it.hasNext()) {
590 FieldInfo minfo = (FieldInfo)it.next();
625 * Returns a static initializer (class initializer), or null if it does not
646 * It does not check method duplication or remove a bridge method.
661 ListIterator it = methods.listIterator(0); local
662 while (it.hasNext())
663 if (isDuplicated(newMinfo, name, descriptor, (MethodInfo)it.next(), it)
[all...] |
| /frameworks/base/services/core/java/com/android/server/job/ |
| JobSchedulerService.java | 67 * about constraints, or the state of active jobs. It receives callbacks from the various
142 * Cleans up outstanding jobs when a package is removed. Even if it's being replaced later we
185 * This cancels the job if it's already been scheduled, and replaces it with the one provided.
225 * This will remove the job from the master list, and cancel the job if it was staged for
242 * This will remove the job from the master list, and cancel the job if it was staged for
308 * and passes it to super.
482 * Called after a periodic has executed so we can to re-add it. We take the last execution time
512 * whether we want to reschedule we readd it to the controllers.
629 * TODO: It would be nice to consolidate these sort of high-level policies somewhere
721 Iterator<JobStatus> it = mPendingJobs.iterator(); local
[all...] |
| /frameworks/support/v4/java/android/support/v4/app/ |
| NotificationManagerCompat.java | 221 // Cancel this notification in notification manager if it just transitioned to being
236 // Parse the string again if it is different from the last time this method was called.
415 Iterator<Map.Entry<ComponentName, ListenerRecord>> it = local
417 while (it.hasNext()) {
418 Map.Entry<ComponentName, ListenerRecord> entry = it.next();
424 it.remove();
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| ArrayListTest.java | 529 // TODO : There is no good way to test this as it only really impacts on
867 Iterator it = al.iterator(); local
870 it.next();
950 // though size is overriden, it should passed without exception
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ArrayBlockingQueue.java | 59 * it is empty. Otherwise it could not be declared final, which is
255 * Inserts the specified element at the tail of this queue if it is
270 * Inserts the specified element at the tail of this queue if it is
417 * because it may be the case that another thread is about to
432 * if it is present. More formally, removes an element {@code e} such
503 * <p>The returned array will be "safe" in that no references to it are
530 * the specified array. If the queue fits in the specified array, it
554 * be stored, if it is big enough; otherwise, a new array of the
720 * this, when a queue has one or more iterators, it keeps iterato
826 final Itr it = p.get(); local
870 final Itr it = p.get(); local
897 final Itr it = p.get(); local
926 Itr it = p.get(); local
[all...] |
| ThreadPoolExecutor.java | 132 * will fail if no threads are immediately available to run it, so a
149 * transient bursts of requests, it admits the possibility of
202 * It is possible to define and use other kinds of {@link
344 * we can only terminate if, after seeing that it is empty, we see
412 * return null even if it may later return non-null when delays
419 * While we could use a concurrent set of some sort, it turns out
424 * that have not yet interrupted. It also simplifies some of the
466 * policy limiting the number of threads. Even though it is not
556 * state to a negative value, and clear it upon start (in
635 * Transitions runState to given target, or leaves it alone i
1737 Iterator<Runnable> it = q.iterator(); local
[all...] |
| /packages/apps/Bluetooth/src/com/android/bluetooth/hdp/ |
| HealthService.java | 116 Iterator <Map.Entry<BluetoothHealthAppConfiguration,AppInfo>>it local
118 while (it.hasNext()) {
119 Map.Entry<BluetoothHealthAppConfiguration,AppInfo> entry = it.next();
123 it.remove();
[all...] |
| /packages/apps/Calendar/src/com/android/calendar/alerts/ |
| GlobalDismissManager.java | 292 Iterator<Map.Entry<LocalDismissId, Long>> it = local
294 while (it.hasNext()) {
295 Map.Entry<LocalDismissId, Long> entry = it.next();
317 it.remove();
330 it.remove();
478 * with the data provider whenever it updates.
484 Iterator<Map.Entry<GlobalDismissId, Long>> it = local
486 while (it.hasNext()) {
487 Map.Entry<GlobalDismissId, Long> entry = it.next();
510 it.remove()
[all...] |
| /packages/apps/Nfc/src/com/android/nfc/cardemulation/ |
| RegisteredServicesCache.java | 63 * That class was not re-used because it doesn't support dynamically
66 * it's less suited.
246 ": it must request the permission " +
253 ": it does not require the permission " +
280 Iterator<Map.Entry<ComponentName, ApduServiceInfo>> it = local
282 while (it.hasNext()) {
284 (Map.Entry<ComponentName, ApduServiceInfo>) it.next();
287 it.remove();
459 // we should have known about it), or somebody calling us from
|
| /packages/apps/Settings/src/com/android/settings/applications/ |
| RunningProcessesView.java | 178 // their labels for performance reasons. Do it now.
488 Iterator<ActiveItem> it = mActiveItems.values().iterator(); local
489 while (it.hasNext()) {
490 ActiveItem ai = it.next();
493 it.remove();
|
| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/JAJP/ |
| OpenWnnEngineJAJP.java | 249 Iterator<WnnWord> it = addCandidateList.iterator(); local
250 while(it.hasNext()) {
251 addCandidate(it.next());
452 Iterator<WnnClause> it = sentence.elements.iterator(); local
453 while(it.hasNext()) {
454 WnnClause clause = (WnnClause)it.next();
|
| /art/compiler/dex/ |
| mir_analysis.cc | 1152 * If huge, assume we won't compile, but allow futher analysis to turn it back on.
1162 /* If it's large and contains no branches, it's likely to be machine generated initialization */
1223 // Get field index and try to find it among existing indexes. If found, it's usually among
1225 // is a linear search, it actually performs much better than map based approach.
1397 auto it = invoke_map.insert(entry).first; \/\/ Iterator to either the old or the new entry. local
[all...] |
| /art/compiler/dex/quick/arm/ |
| call_arm.cc | 58 // Add the table to the list - we'll process it later
90 LIR* it = OpIT(kCondEq, ""); local
92 OpEndIT(it);
103 // Add the table to the list - we'll process it later
193 // Explicit null-check as slow-path is entered using an IT.
207 LIR* it = OpIT(kCondEq, ""); local
210 OpEndIT(it);
212 it = OpIT(kCondNe, "T");
218 OpEndIT(it);
282 // Explicit null-check as slow-path is entered using an IT
300 LIR* it = OpIT(kCondEq, "EE"); local
314 LIR* it = OpIT(kCondEq, ""); local
[all...] |
| /art/compiler/dex/quick/ |
| dex_file_method_inliner.cc | 508 auto it = inline_methods_.find(method_index); local
509 if (it != inline_methods_.end()) {
510 DCHECK_NE(it->second.flags & (kInlineIntrinsic | kInlineSpecial), 0);
511 return it->second.flags;
519 auto it = inline_methods_.find(method_index); local
520 bool res = (it != inline_methods_.end() && (it->second.flags & kInlineIntrinsic) != 0);
522 *intrinsic = it->second;
531 auto it = inline_methods_.find(info->method_ref.dex_method_index); local
532 if (it == inline_methods_.end() || (it->second.flags & kInlineIntrinsic) == 0)
625 auto it = inline_methods_.find(method_index); local
633 auto it = inline_methods_.find(method_idx); local
647 auto it = inline_methods_.find(method_idx); local
1026 auto it = inline_methods_.find(method_index); local
1037 auto it = inline_methods_.find(method_index); local
[all...] |
| /art/compiler/ |
| image_writer.h | 81 auto it = dex_cache_array_starts_.find(dex_file); local
82 DCHECK(it != dex_cache_array_starts_.end());
84 image_begin_ + RoundUp(sizeof(ImageHeader), kObjectAlignment) + it->second + offset);
137 // Subtract read barrier bits since we want these to remain 0, or else it may result in DCHECK
|
| /art/compiler/utils/ |
| test_dex_file_builder.h | 39 auto it = strings_.emplace(str, IdxAndDataOffset()).first; local
40 CHECK_LT(it->first.length(), 128u); // Don't allow multi-byte length in uleb128.
71 auto it = protos_.emplace(proto_key, IdxAndDataOffset()).first; local
72 const ProtoKey* proto = &it->first; // Valid as long as the element remains in protos_.
80 // NOTE: The builder holds the actual data, so it must live as long as the dex file.
207 auto it = protos_.find(*entry.first.proto); local
208 CHECK(it != protos_.end());
209 Write16(raw_offset + 2u, it->second.idx);
223 auto it = strings_.find(type); local
224 CHECK(it != strings_.end())
229 auto it = types_.find(type); local
237 auto it = fields_.find(key); local
246 auto it = methods_.find(method_key); local
[all...] |
| /art/runtime/ |
| intern_table.cc | 346 auto it = post_zygote_table_.Find(GcRoot<mirror::String>(s)); local
347 if (it != post_zygote_table_.end()) {
348 post_zygote_table_.Erase(it);
350 it = pre_zygote_table_.Find(GcRoot<mirror::String>(s));
351 DCHECK(it != pre_zygote_table_.end());
352 pre_zygote_table_.Erase(it);
358 auto it = pre_zygote_table_.Find(GcRoot<mirror::String>(s)); local
359 if (it != pre_zygote_table_.end()) {
360 return it->Read();
362 it = post_zygote_table_.Find(GcRoot<mirror::String>(s))
[all...] |
| mem_map.cc | 58 for (BacktraceMap::const_iterator it = iters.first; it != iters.second; ++it) {
60 static_cast<uint32_t>(it->start),
61 static_cast<uint32_t>(it->end),
62 (it->flags & PROT_READ) ? 'r' : '-',
63 (it->flags & PROT_WRITE) ? 'w' : '-',
64 (it->flags & PROT_EXEC) ? 'x' : '-', it->name.c_str());
71 for (auto it = mem_maps.begin(); it != mem_maps.end(); ++it)
337 auto it = maps_->upper_bound(reinterpret_cast<void*>(ptr)); local
[all...] |
| oat.cc | 36 SafeMap<std::string, std::string>::const_iterator it = variable_data->begin(); local
38 for ( ; it != end; ++it) {
39 estimate += it->first.length() + 1;
40 estimate += it->second.length() + 1;
73 // Don't want asserts in header as they would be checked in each file that includes it. But the
379 // Advance start until it is either end or \0.
463 SafeMap<std::string, std::string>::const_iterator it = key_value_store->begin(); local
465 for ( ; it != end; ++it) {
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
| TokenRewriteStream.java | 392 // include stuff after end if it's last index in buffer
398 Iterator it = indexToOp.values().iterator(); local
399 while (it.hasNext()) {
400 RewriteOperation op = (RewriteOperation)it.next();
476 // delete insert as it's a no-op.
485 // delete replace as it's a no-op.
|
| /external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/cert/ |
| CertificateFactory1Test.java | 518 Iterator it = certFs[i].getCertPathEncodings(); local
519 while (it.hasNext()) {
520 String enc = (String) it.next();
570 Iterator it = certFs[i].getCertPathEncodings(); local
571 while (it.hasNext()) {
573 certFs[i].generateCertPath(is, (String) it.next());
|
| /external/ceres-solver/internal/ceres/ |
| problem_impl.cc | 64 ParameterMap::const_iterator it = parameter_map.find(parameter_block); local
65 CHECK(it != parameter_map.end())
67 return it->second;
99 ParameterMap::iterator it = parameter_block_map_.find(values); local
100 if (it != parameter_block_map_.end()) {
102 int existing_size = it->second->Size();
109 return it->second;
113 // Before adding the parameter block, also check that it doesn't alias any
167 ResidualBlockSet::iterator it = residual_block_set_.find(residual_block); local
168 residual_block_set_.erase(it);
[all...] |
| /external/clang/lib/CodeGen/ |
| CGBlocks.h | 186 /// CanBeGlobal - True if the block can be global, i.e. it has
198 /// because it gets set later in the block-creation process.
229 /// if it corresponds to a global block or a block whose expression
238 it = Captures.find(var); local
239 assert(it != Captures.end() && "no entry for variable!");
240 return it->second;
|
| /external/clang/lib/Lex/ |
| Preprocessor.cpp | 112 // This gets unpoisoned where it is allowed.
167 // Delete the header search info, if we own it.
433 // Resize the buffer if we need to copy into it.
443 /// location for it. If specified, the source location provides a source
486 // If MainFileID is loaded it means we loaded an AST file, no need to enter
499 // #imported, it won't be re-entered.
527 /// identifier information for the token and install it into the token,
532 // Look up this token, see if it is a macro, or if it is a language keyword.
538 // Cleaning needed, alloca a buffer, clean into it, then use the buffer
579 llvm::DenseMap<IdentifierInfo*,unsigned>::const_iterator it = local
[all...] |
| /external/dexmaker/src/main/java/com/google/dexmaker/ |
| DexMaker.java | 66 * the generated dex file must be installed on an Android device before it
93 * <p>Next we declare the class. It allows us to specify the type's source file
94 * for stack traces, its modifiers, its superclass, and the interfaces it
102 * It is illegal to declare members of a class without also declaring the class
105 * <p>To make it easier to go from our Java method to dex instructions, we'll
106 * manually translate it to pseudocode fit for an assembler. We need to replace
136 * <p>One limitation of {@code DexMaker}'s API is that it requires all local
156 * and {@code Integer}, but it can be a hindrance when generating code that
178 * <p>We're done defining the dex file. We just need to write it to the
179 * filesystem or load it into the current process. For this example we'll loa
336 Iterator<TypeId<?>> it = typesKeySet.iterator(); local
[all...] |
