/system/libufdt/include/ |
H A D | ufdt_types.h | 22 /* it has type : struct ufdt_node** */ 23 #define for_each(it, node) \ 25 for ((it) = (node)->nodes; (it) != (node)->nodes + (node)->mem_size; ++(it)) \ 26 if (*(it)) 28 #define for_each_child(it, node) \ 30 for ((it) = &(((struct ufdt_node_fdt_node *)(node))->child); *(it); \ 31 (it) [all...] |
/system/core/init/ |
H A D | property_type.cpp | 60 auto it = value.begin(); local 61 while (it != value.end() && isdigit(*it)) { 62 it++; 64 if (it == value.begin() || it == value.end() || (*it != 'g' && *it != 'k' && *it != 'm')) { 67 it [all...] |
/system/core/base/ |
H A D | quick_exit.cpp | 32 for (auto it = quick_exit_handlers.rbegin(); it != quick_exit_handlers.rend(); ++it) { 33 (*it)();
|
/system/core/logd/ |
H A D | LogWhiteBlackList.cpp | 58 PruneCollection::iterator it; local 59 for (it = mNice.begin(); it != mNice.end();) { 60 it = mNice.erase(it); 62 for (it = mNaughty.begin(); it != mNaughty.end();) { 63 it = mNaughty.erase(it); 70 PruneCollection::iterator it; local 185 PruneCollection::iterator it = list->begin(); local 232 PruneCollection::iterator it; local 254 PruneCollection::iterator it; local 264 PruneCollection::iterator it; local [all...] |
H A D | LogBuffer.cpp | 76 LogBufferElementCollection::iterator it = mLogElements.begin(); local 77 while ((it != mLogElements.end())) { 78 LogBufferElement* e = *it; 94 ++it; 102 // NB: this is _not_ performed in the context of a SIGHUP, it is 141 // is it mostly identical? 393 LogBufferElementCollection::iterator it = mLogElements.end(); local 394 LogBufferElementCollection::iterator last = it; 395 if (__predict_true(it != mLogElements.begin())) --it; 472 erase( LogBufferElementCollection::iterator it, bool coalesce) argument 590 LogBufferElementMap::iterator it = map.find(key.getKey()); local 725 LogBufferElementCollection::iterator it; local 1109 LogBufferElementCollection::iterator it; local [all...] |
/system/update_engine/payload_generator/ |
H A D | graph_utils.cc | 42 for (vector<Extent>::const_iterator it = extents.begin(); 43 it != extents.end(); ++it) { 44 if (it->start_block() != kSparseHole) 45 weight += it->num_blocks(); 68 for (vector<Extent>::const_iterator it = extents.begin(), e = extents.end(); 69 it != e; ++it) { 70 const Extent& extent = *it; 81 for (Vertex::EdgeMap::iterator it [all...] |
H A D | extent_ranges.cc | 87 for (ExtentSet::iterator it = extent_set_.begin(), e = extent_set_.end(); 88 it != e; ++it) { 89 if (ExtentsOverlapOrTouch(*it, extent)) { 90 end_del = it; 92 del_blocks += it->num_blocks(); 94 begin_del = it; 96 extent = UnionOverlappingExtents(extent, *it); 131 for (ExtentSet::iterator it = extent_set_.begin(), e = extent_set_.end(); 132 it ! [all...] |
H A D | tarjan.cc | 40 for (Graph::iterator it = graph->begin(); it != graph->end(); ++it) 41 it->index = it->lowlink = kInvalidIndex; 55 for (Vertex::EdgeMap::iterator it = (*graph)[vertex].out_edges.begin(); 56 it != (*graph)[vertex].out_edges.end(); ++it) { 57 Vertex::Index vertex_next = it->first;
|
H A D | topological_sort.cc | 39 for (Vertex::EdgeMap::const_iterator it = graph[node].out_edges.begin(); 40 it != graph[node].out_edges.end(); ++it) { 41 TopologicalSortVisit(graph, visited_nodes, nodes, it->first);
|
/system/extras/memtrack/ |
H A D | memtrack.cpp | 167 for (processes_t::iterator it = all_.begin(); it != all_.end(); ++it) { 168 it->second.pids.clear(); 195 for (cur_processes_t::const_iterator it = cur_.begin(); 196 it != cur_.end(); ++it) { 198 if (all_.count(it->first) == 0) { 200 all_[it->first].num_samples = 0; 201 all_[it [all...] |
/system/netd/server/ |
H A D | PppController.cpp | 43 TtyCollection::iterator it; local 45 for (it = mTtys->begin(); it != mTtys->end(); ++it) { 46 free(*it); 62 TtyCollection::iterator it; local 63 for (it = mTtys->begin(); it != mTtys->end(); ++it) { 64 if (!strcmp(tty, *it)) { 131 TtyCollection::iterator it; local [all...] |
/system/core/logcat/ |
H A D | logcatd_main.cpp | 52 for (std::vector<const char*>::iterator it = argv_hold.begin(); 53 it != argv_hold.end();) { 54 if (!*it || (strcmp(*it, "-L") && strcmp(*it, "--last"))) { 55 ++it; 57 it = argv_hold.erase(it);
|
/system/tools/hidl/c2hal/ |
H A D | Scope.h | 49 auto it = mScopeContents.find(name); local 51 if (it != mScopeContents.end()) { 61 auto it = mScopeContents.find(name); local 63 if (it == mScopeContents.end()) { 68 mScopeContents.erase(it); 73 auto it = mScopeContents.find(name); local 75 if (it == mScopeContents.end()) { 79 return (*it).second;
|
H A D | AST.cpp | 141 auto it = mDeclarations->begin(); local 142 while (it != mDeclarations->end()) { 143 if ((*it)->decType() == CompositeDeclaration::type() 144 && ((CompositeDeclaration *) (*it))->isInterface()) { 146 mInterfaces->push_back((CompositeDeclaration *) *it); 147 it = mDeclarations->erase(it); 149 it++; 160 auto it = mDeclarations->begin(); local 161 while (it ! 187 auto it = mDeclarations->begin(); local 202 auto it = mDeclarations->begin(); local [all...] |
H A D | Type.cpp | 75 auto it = kSignedToUnsignedMap.find(signedType); local 77 if (it == kCToHidlMap.end()) { 81 return (*it).second; 108 auto it = kCToHidlMap.find(cType); local 110 if (it == kCToHidlMap.end()) { 114 return (*it).second; 124 for (auto it = mQualifiers->begin(); it != mQualifiers->end(); ++it) { 125 if (it ! [all...] |
/system/core/libsysutils/src/ |
H A D | SocketListener.cpp | 66 SocketClientCollection::iterator it; local 67 for (it = mClients->begin(); it != mClients->end();) { 68 (*it)->decRef(); 69 it = mClients->erase(it); 138 SocketClientCollection::iterator it; local 139 for (it = mClients->begin(); it != mClients->end();) { 140 delete (*it); 159 SocketClientCollection::iterator it; local 252 SocketClientCollection::iterator it; local [all...] |
/system/core/libmemunreachable/ |
H A D | HeapWalker.cpp | 58 // for example mprotect(PROT_NONE) on a native heap page. If so, it will be 63 AllocationMap::iterator it = allocations_.find(Range{value, value + 1}); local 64 if (it != allocations_.end()) { 65 *range = it->first; 66 *info = &it->second; 106 for (auto it = roots_.begin(); it != roots_.end(); it++) { 107 RecurseRoot(*it); 125 for (auto it [all...] |
H A D | MemUnreachable.cpp | 98 for (auto it = heap_mappings.begin(); it != heap_mappings.end(); it++) { 99 MEM_ALOGV("Heap mapping %" PRIxPTR "-%" PRIxPTR " %s", it->begin, it->end, it->name); 100 HeapIterate(*it, 104 for (auto it = anon_mappings.begin(); it != anon_mappings.end(); it [all...] |
/system/core/libbinderwrapper/ |
H A D | stub_binder_wrapper.cc | 38 const auto it = registered_services_.find(service_name); local 39 return it != registered_services_.end() ? it->second : sp<IBinder>(); 43 const auto it = death_callbacks_.find(binder); local 44 if (it != death_callbacks_.end()) 45 it->second.Run(); 49 const auto it = services_to_return_.find(service_name); local 50 return it != services_to_return_.end() ? it->second : sp<IBinder>();
|
/system/hwservicemanager/ |
H A D | HidlService.cpp | 63 for (auto it = mListeners.begin(); it != mListeners.end();) { 64 if (interfacesEqual(*it, listener.promote())) { 65 it = mListeners.erase(it); 68 ++it; 97 for (auto it = mListeners.begin(); it != mListeners.end();) { 98 auto ret = (*it)->onRegistration(iface, name, false /* preexisting */); 100 ++it; [all...] |
/system/netd/server/dns/ |
H A D | DnsTlsQueryMap.cpp | 30 // Store the query so it can be matched to the response or reissued. 41 std::map<uint16_t, QueryPromise>::iterator it; local 43 std::tie(it, inserted) = mQueries.emplace(newId, q); 48 return std::make_unique<QueryFuture>(q, it->second.result.get_future()); 58 auto it = mQueries.find(newId); local 59 if (it != mQueries.end()) { 60 it->second.tries++; 66 for (auto it = mQueries.begin(); it != mQueries.end();) { 67 auto& p = it 133 auto it = mQueries.find(id); local [all...] |
/system/update_engine/ |
H A D | fake_shill_proxy.cc | 33 auto it = service_proxy_mocks_.find(path.value()); local 34 CHECK(it != service_proxy_mocks_.end()) << "No ServiceProxyMock set for " 36 std::unique_ptr<ServiceProxyInterface> result = std::move(it->second); 37 service_proxy_mocks_.erase(it);
|
/system/extras/libperfmgr/ |
H A D | RequestGroup.cc | 49 for (auto it = request_map_.begin(); it != request_map_.end();) { 51 it->second - now); 53 it = request_map_.erase(it); 57 ++it;
|
/system/libufdt/ |
H A D | ufdt_node.c | 48 struct ufdt_node *it = ((struct ufdt_node_fdt_node *)node)->child; local 49 while (it != NULL) { 50 struct ufdt_node *next = it->sibling; 51 ufdt_node_destruct(it, pool); 52 it = next; 87 struct ufdt_node **it = NULL; local 88 for_each_node(it, node) { 89 if (ufdt_node_name_eq(*it, name, len)) return *it; 103 struct ufdt_node **it local 208 struct ufdt_node *it; local 285 struct ufdt_node **it; local [all...] |
/system/bt/packet/avrcp/ |
H A D | get_item_attributes.cc | 88 auto it = begin() + BrowsePacket::kMinSize(); local 89 return static_cast<Scope>(*it); 93 auto it = begin() + BrowsePacket::kMinSize() + static_cast<size_t>(1); local 94 return base::ByteSwap(it.extract<uint64_t>()); 98 auto it = begin() + BrowsePacket::kMinSize() + static_cast<size_t>(9); local 99 return base::ByteSwap(it.extract<uint16_t>()); 103 auto it = begin() + BrowsePacket::kMinSize() + static_cast<size_t>(11); local 104 return *it; 109 auto it = begin() + BrowsePacket::kMinSize() + static_cast<size_t>(11); local 110 size_t number_of_attributes = it [all...] |