| /frameworks/compile/mclinker/include/mcld/ |
| InputTree.h | 100 bfs_iterator it = bfs_iterator(BinaryTreeBase<Input>::m_Root.node.left); local
101 if (it.isGroup())
102 ++it;
103 return it;
111 const_bfs_iterator it = local
113 if (it.isGroup())
114 ++it;
115 return it;
123 dfs_iterator it = dfs_iterator(BinaryTreeBase<Input>::m_Root.node.left); local
124 if (it.isGroup()
134 const_dfs_iterator it = local
155 iterator it = iterator(BinaryTreeBase<Input>::m_Root.node.left); local
[all...] |
| /frameworks/compile/mclinker/lib/LD/ |
| GarbageCollection.cpp | 89 ReachedSectionsTy::iterator it = m_ReachedSections.find(&pSection); local
90 if (it == m_ReachedSections.end())
92 return &it->second;
134 // 2. it has no reloc data. (All symbols in the input relocs are in the
308 // means no referenced between it and other sections, then skip it
316 SectionListTy::iterator it, end = reach_list->end(); local
317 for (it = reach_list->begin(); it != end; ++it) {
[all...] |
| IdenticalCodeFolding.cpp | 89 KeptSections::iterator it = m_KeptSections.begin() + kept_index; local
90 LDSection* kept_sect = (*it).first;
91 Input* kept_obj = (*it).second.first;
199 for (ChecksumMap::iterator it = ret.first; it != ret.second; ++it) {
200 size_t kept_index = (*it).second;
289 KeptSections::const_iterator it = pKeptSections.find(def); local
290 llvm::format_object<size_t> kept_info("%x", (*it).second.second);
|
| /frameworks/compile/mclinker/lib/Target/ARM/ |
| ARMException.cpp | 42 for (ARMInputExMap::iterator it = exMap->begin(), end = exMap->end();
43 it != end; ++it) {
44 ARMExSectionTuple* exTuple = it->second.get();
50 for (Module::obj_iterator it = pModule.obj_begin(),
51 end = pModule.obj_end(); it != end; ++it) {
52 Input* input = *it;
59 for (SectionData::iterator it = sectData->begin(),
60 end = sectData->end(); it != end; ++it)
97 ARMInputExMap::iterator it = exMap->begin(); local
258 SectionData::FragmentListType::iterator it = list.begin(); local
[all...] |
| ARMException.h | 164 NameMap::const_iterator it = m_NameToExData.find(pName); local
165 if (it == m_NameToExData.end()) {
168 return it->second.get();
219 void erase(iterator it) { m_NameToExData.erase(it); }
241 InputMap::const_iterator it = m_Inputs.find(pInput); local
242 if (it == m_Inputs.end()) {
245 return it->second.get();
250 ExIdxMap::const_iterator it = m_ExIdxToTuple.find(pExIdxFragment); local
251 if (it == m_ExIdxToTuple.end())
[all...] |
| /frameworks/compile/mclinker/lib/Target/Mips/ |
| MipsGOT.cpp | 103 for (MultipartListType::iterator it = m_MultipartList.begin();
104 it != m_MultipartList.end();
105 ++it) {
107 it->m_pLastLocal = &m_SectionData->back();
108 reserve(it->m_LocalNum);
109 it->m_pLastGlobal = &m_SectionData->back();
110 reserve(it->m_GlobalNum);
112 if (it == m_MultipartList.begin()) {
116 reserve(getGlobalNum() - it->m_GlobalNum);
121 size_t count = it->m_GlobalNum + it->m_LocalNum
328 GotEntryMapType::iterator it = m_GotGlobalEntriesMap.find(key); local
352 GotEntryMapType::iterator it = m_GotLocalEntriesMap.find(key); local
[all...] |
| /frameworks/compile/mclinker/lib/Target/X86/ |
| X86LDBackend.cpp | 174 X86PLT::iterator it = m_pPLT->begin(); local
175 unsigned int plt0_size = llvm::cast<PLTEntryBase>((*it)).size();
177 memcpy(buffer, llvm::cast<PLTEntryBase>((*it)).getValue(), plt0_size);
179 ++it;
183 while (it != ie) {
184 plt1 = &(llvm::cast<PLTEntryBase>(*it));
188 ++it;
477 for (X86_32GOT::iterator it = m_pGOT->begin(), ie = m_pGOT->end(); it != ie;
478 ++it, ++buffer)
[all...] |
| /frameworks/ex/common/java/com/android/common/ |
| NetworkConnectivityListener.java | 99 Iterator<Handler> it = mHandlers.keySet().iterator(); local
100 while (it.hasNext()) {
101 Handler target = it.next();
218 * This returns it.
|
| /frameworks/native/services/surfaceflinger/ |
| Transform.cpp | 229 Region::const_iterator it = reg.begin(); local
231 while (it != end) {
232 out.orSelf(transform(*it++));
|
| /frameworks/opt/bitmap/src/com/android/bitmap/ |
| ContiguousFIFOAggregator.java | 43 * which has no task associated with it, so we store task <b>2</b>. </li>
49 * <li>Key <b>C</b> is now the first expected key, but it has no task,
188 * stopping when it finds that the first expected key has not yet been assigned a task.
254 Iterator<T> it = mExpected.iterator(); local
255 while (it.hasNext()) {
256 final T key = it.next();
262 if (it.hasNext()) {
285 * expected, it would either have to be forgotten with {@link #forget(Object)} or a task
289 * keep state, or it can keep state which may have changed so the callback can do
|
| /frameworks/opt/net/wifi/service/java/com/android/server/wifi/ |
| ScanDetailCache.java | 72 Iterator<ScanDetail> it = mMap.values().iterator(); local
73 return it.hasNext() ? it.next() : null;
|
| /hardware/qcom/camera/QCamera2/HAL/ |
| QCameraChannel.cpp | 1121 List<OfflineBuffer>::iterator it = mOfflineBuffers.begin(); local
[all...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/text/ |
| StringCharacterIteratorTest.java | 155 StringCharacterIterator it = new StringCharacterIterator("testing", 2, local
157 StringCharacterIterator clone = (StringCharacterIterator) it.clone();
158 assertTrue("Clone not equal", it.equals(clone));
170 StringCharacterIterator it = local
172 assertEquals("Wrong current char", 'i', it.current());
407 StringCharacterIterator it = new StringCharacterIterator("testing"); local
408 assertEquals("Wrong begin index", 0, it.getBeginIndex());
409 assertEquals("Wrong end index", 7, it.getEndIndex());
410 assertEquals("Wrong current index", 0, it.getIndex());
411 assertEquals("Wrong current char", 't', it.current())
420 StringCharacterIterator it = new StringCharacterIterator("testing", 3); local
433 StringCharacterIterator it = new StringCharacterIterator("testing", 2, local
[all...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| WeakHashMapTest.java | 190 Iterator it = entrySet.iterator(); local
191 while (it.hasNext()) {
192 Map.Entry entry = (Map.Entry) it.next();
305 Iterator it = keySet.iterator(); local
306 while (it.hasNext()) {
307 Object key = it.next();
383 Iterator it = valuesCollection.iterator(); local
384 while (it.hasNext()) {
385 Object value = it.next();
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| ArrayBlockingQueueTest.java | 605 Iterator it = q.iterator(); local
607 Integer x = (Integer) it.next();
648 Iterator it = q.iterator(); local
650 Integer x = (Integer) it.next();
705 Iterator it = q.iterator(); local
707 for (i = 0; it.hasNext(); i++)
708 assertTrue(q.contains(it.next()));
710 assertIteratorExhausted(it);
712 it = q.iterator();
713 for (i = 0; it.hasNext(); i++
735 Iterator it = q.iterator(); local
[all...] |
| ArrayDequeTest.java | 638 Iterator it = q.iterator(); local
640 Integer x = (Integer) it.next();
680 Iterator it = q.iterator(); local
682 Integer x = (Integer) it.next();
749 Iterator it = q.iterator(); local
751 for (i = 0; it.hasNext(); i++)
752 assertTrue(q.contains(it.next()));
754 assertIteratorExhausted(it);
775 for (Iterator it = q.iterator(); it.hasNext();)
793 Iterator it = q.iterator(); local
816 Iterator it = q.descendingIterator(); local
861 Iterator it = q.descendingIterator(); local
[all...] |
| ConcurrentLinkedDequeTest.java | 703 Iterator it = q.iterator(); local
705 for (i = 0; it.hasNext(); i++)
706 assertTrue(q.contains(it.next()));
708 assertIteratorExhausted(it);
730 for (Iterator it = q.iterator(); it.hasNext();) {
731 assertEquals(++k, it.next());
746 for (Iterator it = q.iterator(); it.hasNext();) {
748 it.next()
765 Iterator it = q.iterator(); local
788 Iterator it = q.descendingIterator(); local
833 Iterator it = q.descendingIterator(); local
[all...] |
| ConcurrentSkipListSetTest.java | 480 Iterator it = q.iterator(); local
482 for (i = 0; it.hasNext(); i++)
483 assertTrue(q.contains(it.next()));
485 assertIteratorExhausted(it);
506 Iterator it = q.iterator(); local
507 it.next();
508 it.remove();
510 it = q.iterator();
511 assertEquals(it.next(), new Integer(2));
512 assertEquals(it.next(), new Integer(3))
[all...] |
| ConcurrentSkipListSubSetTest.java | 438 Iterator it = q.iterator(); local
440 for (i = 0; it.hasNext(); i++)
441 assertTrue(q.contains(it.next()));
443 assertIteratorExhausted(it);
462 Iterator it = q.iterator(); local
463 it.next();
464 it.remove();
466 it = q.iterator();
467 assertEquals(it.next(), new Integer(2));
468 assertEquals(it.next(), new Integer(3))
930 Iterator it = q.iterator(); local
944 Iterator it = q.iterator(); local
961 Iterator it = q.iterator(); local
[all...] |
| LinkedTransferQueueTest.java | 100 * Queue contains all elements of the collection it is initialized by
511 Iterator it = q.iterator(); local
513 for (i = 0; it.hasNext(); i++)
514 assertTrue(q.contains(it.next()));
516 assertIteratorExhausted(it);
518 it = q.iterator();
519 for (i = 0; it.hasNext(); i++)
520 assertEquals(it.next(), q.take());
522 assertIteratorExhausted(it);
541 Iterator it = q.iterator() local
[all...] |
| TreeSetTest.java | 485 Iterator it = q.iterator(); local
487 for (i = 0; it.hasNext(); i++)
488 assertTrue(q.contains(it.next()));
490 assertIteratorExhausted(it);
509 Iterator it = q.iterator(); local
510 it.next();
511 it.remove();
513 it = q.iterator();
514 assertEquals(it.next(), new Integer(2));
515 assertEquals(it.next(), new Integer(3))
[all...] |
| TreeSubSetTest.java | 435 Iterator it = q.iterator(); local
437 for (i = 0; it.hasNext(); i++)
438 assertTrue(q.contains(it.next()));
440 assertIteratorExhausted(it);
459 Iterator it = q.iterator(); local
460 it.next();
461 it.remove();
463 it = q.iterator();
464 assertEquals(2, it.next());
465 assertEquals(3, it.next())
916 Iterator it = q.iterator(); local
930 Iterator it = q.iterator(); local
947 Iterator it = q.iterator(); local
[all...] |
| /libcore/luni/src/main/java/java/nio/charset/ |
| Charset.java | 68 * {@code 0xfe, 0xff}, for example, it knows it's reading a big-endian byte sequence, while
77 * reason to prefer UTF-8: it's one less complication to worry about.)
136 * {@link #isSupported} to see what's available. If you intend to use the charset if it's
137 * available, just call {@link #forName} and catch the exceptions it throws if the charset isn't
153 * it returns are inherently stateful.
217 * If multiple charsets have the same canonical name, it is unspecified which is returned in
231 Iterator<Charset> it = charsetProvider.charsets(); local
232 while (it.hasNext()) {
233 Charset cs = it.next()
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| DelayQueue.java | 53 * the leader, it waits only for the next delay to elapse, but
292 * Returns first element only if it is expired.
386 * <p>The returned array will be "safe" in that no references to it are
409 * If the queue fits in the specified array, it is returned therein.
432 * be stored, if it is big enough; otherwise, a new array of the
452 * queue, if it is present, whether or not it has expired.
471 for (Iterator<E> it = q.iterator(); it.hasNext(); ) {
472 if (o == it.next())
[all...] |
| /libcore/luni/src/main/java/java/util/zip/ |
| ZipEntry.java | 153 * or as a path component, it must be validated or sanitized to ensure that files are not
256 * note that you'll have to set the size (or compressed size; they must be the same, but it's
385 BufferIterator it = HeapBufferIterator.iterator(cdeHdrBuf, 0, cdeHdrBuf.length, local
388 int sig = it.readInt();
393 it.seek(8);
394 int gpbf = it.readShort() & 0xffff;
407 compressionMethod = it.readShort() & 0xffff;
408 time = it.readShort() & 0xffff;
409 modDate = it.readShort() & 0xffff;
412 crc = ((long) it.readInt()) & 0xffffffffL
[all...] |
