Searched refs:it (Results 1 - 25 of 136) sorted by relevance

123456

/frameworks/compile/mclinker/unittests/
H A DSymbolTableTest.cpp19 // create testee. modify it if need
42 mcld::SymbolTable<>::iterator it; local
43 it = m_pTestee->begin();
44 ASSERT_EQ(it, m_pTestee->end());
H A DStringTableTest.cpp20 // create testee. modify it if need
61 StringTable::iterator it = m_pTestee->begin(); local
62 ASSERT_STREQ(*it, "Hello");
63 ++it;
64 ASSERT_STREQ(*it, "World");
65 ++it;
66 ASSERT_STREQ(*it, "Media");
67 ++it;
68 ASSERT_STREQ(*it, "Tek");
69 ++it;
[all...]
/frameworks/compile/mclinker/lib/Target/Mips/
H A DMipsGOT.cpp36 iterator it = m_SectionData->begin(); local
39 assert((it != m_SectionData->end()) &&
42 ++it;
45 m_LocalGOTIterator = it;
46 m_GlobalGOTIterator = it;
79 for (iterator it = begin(), ie = end();
80 it != ie; ++it, ++buffer) {
81 MipsGOTEntry* got = &(llvm::cast<MipsGOTEntry>((*it)));
105 iterator& it local
114 iterator& it = m_GlobalGOTIterator; local
[all...]
/frameworks/base/core/java/android/util/
H A DFastImmutableArraySet.java26 * so it is worth copying the contents of the set to an array when iterating over it
40 FastIterator<T> it = mIterator;
41 if (it == null) {
42 it = new FastIterator<T>(mContents);
43 mIterator = it;
45 it.mIndex = 0;
47 return it;
/frameworks/compile/mclinker/lib/LD/
H A DELFSegment.cpp43 for (const_sect_iterator it = begin(), ie = end(); it != ie; ++it) {
44 if ((*it)->kind() != LDFileFormat::BSS) {
57 const_sect_iterator it = begin(), ie = end(); local
58 for (; it != ie; ++it) {
59 if ((*it)->kind() != LDFileFormat::BSS)
62 if (it == ie)
H A DSectionRules.cpp80 const_iterator it = find(pName); local
83 // If not, we need to find it in output context. But this should be rare.
84 if (it != m_RuleList.end())
85 section = (*it).target;
94 iterator it = find(pName); local
95 if (it != m_RuleList.end()) {
96 assert(NULL == (*it).target);
97 (*it).target = &pSection;
105 SectionMap::const_iterator it; local
106 for (it
[all...]
H A DBranchIslandFactory.cpp80 for (iterator it = begin(), ie = end(); it != ie; ++it) {
81 if ((pFragment.getOffset() < (*it).offset()) &&
82 ((pFragment.getOffset() + m_MaxBranchRange) >= (*it).offset()))
83 return &(*it);
H A DGroupReader.cpp104 ArchiveListType::iterator it = ar_list.begin(); local
109 for (it = ar_list.begin(); it != end; ++it) {
110 Archive& ar = (*it)->archive;
111 // if --whole-archive is given to this archive, no need to read it again
121 for (it = ar_list.begin(); it != end; ++it) {
122 Archive& ar = (*it)
[all...]
H A DStubFactory.cpp28 for (StubPoolType::iterator it = m_StubPool.begin(), ie = m_StubPool.end();
29 it != ie; ++it)
30 delete(*it);
89 for (Stub::fixup_iterator it = stub->fixup_begin(),
90 ie = stub->fixup_end(); it != ie; ++it) {
92 Relocation* reloc = Relocation::Create((*it)->type(),
93 *(FragmentRef::Create(*stub, (*it)->offset())),
94 (*it)
[all...]
/frameworks/av/media/libstagefright/foundation/
H A DAAtomizer.cpp43 List<AString>::iterator it = entry.begin(); local
44 while (it != entry.end()) {
45 if ((*it) == name) {
46 return (*it).c_str();
48 ++it;
/frameworks/compile/mclinker/lib/Target/X86/
H A DX86GOTPLT.cpp52 iterator it = begin(); local
55 ++it;
58 for (; it != end() ; ++it) {
59 llvm::cast<X86_32GOTEntry>(*it).setValue(plt_addr + 6);
96 iterator it = begin(); local
99 ++it;
102 for (; it != end() ; ++it) {
103 llvm::cast<X86_64GOTEntry>(*it)
[all...]
/frameworks/av/media/libstagefright/rtsp/
H A DARTPAssembler.cpp78 for (List<sp<ABuffer> >::const_iterator it = frames.begin();
79 it != frames.end(); ++it) {
81 totalSize += (*it)->size() + 7;
86 for (List<sp<ABuffer> >::const_iterator it = frames.begin();
87 it != frames.end(); ++it) {
88 sp<ABuffer> nal = *it;
125 for (List<sp<ABuffer> >::const_iterator it = packets.begin();
126 it !
[all...]
H A DAH263Assembler.cpp61 List<sp<ABuffer> >::iterator it = queue->begin(); local
62 while (it != queue->end()) {
63 if ((uint32_t)(*it)->int32Data() >= mNextExpectedSeqNo) {
67 it = queue->erase(it);
160 List<sp<ABuffer> >::iterator it = mPackets.begin(); local
161 while (it != mPackets.end()) {
162 const sp<ABuffer> &unit = *it;
165 ++it;
170 it
[all...]
H A DAAVCAssembler.cpp55 List<sp<ABuffer> >::iterator it = queue->begin(); local
56 while (it != queue->end()) {
57 if ((uint32_t)(*it)->int32Data() >= mNextExpectedSeqNo) {
61 it = queue->erase(it);
219 List<sp<ABuffer> >::iterator it = ++queue->begin(); local
220 while (it != queue->end()) {
223 const sp<ABuffer> &buffer = *it;
243 it = queue->begin();
245 it
286 List<sp<ABuffer> >::iterator it = queue->begin(); local
[all...]
H A DARTPConnection.cpp217 List<StreamInfo>::iterator it = mStreams.begin(); local
218 while (it != mStreams.end()
219 && (it->mRTPSocket != rtpSocket || it->mRTCPSocket != rtcpSocket)) {
220 ++it;
223 if (it == mStreams.end()) {
227 mStreams.erase(it);
256 for (List<StreamInfo>::iterator it = mStreams.begin();
257 it != mStreams.end(); ++it) {
280 List<StreamInfo>::iterator it = mStreams.begin(); local
311 List<StreamInfo>::iterator it = mStreams.begin(); local
654 List<StreamInfo>::iterator it = mStreams.begin(); local
[all...]
H A DAMPEG2TSAssembler.cpp60 List<sp<ABuffer> >::iterator it = queue->begin(); local
61 while (it != queue->end()) {
62 if ((uint32_t)(*it)->int32Data() >= mNextExpectedSeqNo) {
66 it = queue->erase(it);
/frameworks/opt/telephony/src/java/com/android/internal/telephony/sip/
H A DSipCallBase.java45 for (Iterator<Connection> it = mConnections.iterator(); it.hasNext(); ) {
46 Connection c = it.next();
47 if (c.getState() == State.DISCONNECTED) it.remove();
/frameworks/av/media/libstagefright/
H A DTimedEventQueue.cpp107 List<QueueItem>::iterator it = mQueue.begin(); local
108 while (it != mQueue.end() && realtime_us >= (*it).realtime_us) {
109 ++it;
116 if (it == mQueue.begin()) {
120 mQueue.insert(it, item);
148 // if MatchesEventID found a match, it will have set id to 0
160 List<QueueItem>::iterator it = mQueue.begin(); local
161 while (it != mQueue.end()) {
162 if (!(*predicate)(cookie, (*it)
218 List<QueueItem>::iterator it = mQueue.begin(); local
[all...]
H A DDataSource.cpp118 for (List<SnifferFunc>::iterator it = gSniffers.begin();
119 it != gSniffers.end(); ++it) {
123 if ((*it)(this, &newMimeType, &newConfidence, &newMeta)) {
139 for (List<SnifferFunc>::iterator it = gSniffers.begin();
140 it != gSniffers.end(); ++it) {
141 if (*it == func) {
218 // Assume it's a filename.
/frameworks/av/services/camera/libcameraservice/gui/
H A DRingBufferConsumer.cpp65 List<RingBufferItem>::iterator it, end, accIt; local
71 for (it = mBufferItemList.begin(), end = mBufferItemList.end();
72 it != end;
73 ++it) {
75 const RingBufferItem& item = *it;
91 accIt = it;
153 List<RingBufferItem>::iterator it, end; local
155 for (it = mBufferItemList.begin(), end = mBufferItemList.end();
156 it != end;
157 ++it) {
178 List<RingBufferItem>::iterator it, end, accIt; local
305 List<RingBufferItem>::iterator it, end, accIt; local
[all...]
/frameworks/compile/mclinker/lib/Support/
H A DMemoryArea.cpp61 // we never remove it. In that way, space can not be NULL.
90 // we never remove it. Otherwise, we have to synchronize and release
93 // synchronize writable space before we release it.
99 SpaceMapType::iterator it; local
100 for (it = range.first; it != range.second; ++it) {
101 if (space == it->second)
104 m_SpaceMap.erase(it);
144 SpaceMapType::iterator it local
153 SpaceMapType::const_iterator it = m_SpaceMap.find(Key(pOffset, pLength)); local
[all...]
/frameworks/base/tools/aidl/
H A Dsearch_path.cpp33 for (vector<string>::iterator it=paths.begin(); it!=paths.end(); it++) {
34 string f = *it;
/frameworks/base/media/mca/filterfw/native/core/
H A Dgl_env.cpp44 for (std::map<int, SurfaceWindowPair>::iterator it = surfaces_.begin();
45 it != surfaces_.end();
46 ++it) {
47 if (it->first != 0 || created_surface_) {
48 eglDestroySurface(display(), it->second.first);
49 if (it->second.second) {
50 it->second.second->Destroy();
51 delete it->second.second;
57 for (std::map<int, EGLContext>::iterator it = contexts_.begin();
58 it !
[all...]
/frameworks/base/media/mca/filterfw/native/base/
H A Dutilities.h44 // For hash_[multi]set, it is important that this deletes behind the iterator
45 // because the hash_set may call the hash function on the iterator when it is
60 // in the case it's given a NULL pointer.
77 typename Collection::const_iterator it = collection.find(key); local
78 if (it == collection.end()) {
81 return &it->second;
131 typename Collection::const_iterator it = collection.find(key); local
132 if (it == collection.end()) {
135 return it->second;
/frameworks/base/media/mca/filterpacks/native/base/
H A Dutilities.h44 // For hash_[multi]set, it is important that this deletes behind the iterator
45 // because the hash_set may call the hash function on the iterator when it is
60 // in the case it's given a NULL pointer.
77 typename Collection::const_iterator it = collection.find(key); local
78 if (it == collection.end()) {
81 return &it->second;
131 typename Collection::const_iterator it = collection.find(key); local
132 if (it == collection.end()) {
135 return it->second;

Completed in 2113 milliseconds

123456