Home
last modified time | relevance | path

Searched refs:mRequests (Results 1 – 6 of 6) sorted by relevance

/system/chre/core/include/chre/core/
Drequest_multiplexer_impl.h32 bool requestStored = mRequests.push_back(request); in addRequest()
34 *index = (mRequests.size() - 1); in addRequest()
45 CHRE_ASSERT(index < mRequests.size()); in updateRequest()
47 if (index < mRequests.size()) { in updateRequest()
48 mRequests[index] = request; in updateRequest()
57 CHRE_ASSERT(index < mRequests.size()); in removeRequest()
59 if (index < mRequests.size()) { in removeRequest()
60 mRequests.erase(index); in removeRequest()
70 mRequests.clear(); in removeAllRequests()
77 return mRequests; in getRequests()
[all …]
Drequest_multiplexer.h120 DynamicVector<RequestType> mRequests;
Dgnss_manager.h145 DynamicVector<Request> mRequests; variable
/system/chre/core/
Dgnss_manager.cc65 if (!mRequests.reserve(1)) { in GnssSession()
120 for (const auto& request : mRequests) { in logStateToBuffer()
170 for (size_t i = 0; i < mRequests.size(); i++) { in nanoappHasRequest()
171 if (mRequests[i].nanoappInstanceId == instanceId) { in nanoappHasRequest()
202 return !mRequests.empty(); in isEnabled()
212 && mRequests.size() == 1); in stateTransitionIsRequired()
224 const auto& currentRequest = mRequests[requestIndex]; in stateTransitionIsRequired()
225 for (size_t i = 0; i < mRequests.size(); i++) { in stateTransitionIsRequired()
226 const Request& request = mRequests[i]; in stateTransitionIsRequired()
255 mRequests[requestIndex].minInterval = minInterval; in updateRequests()
[all …]
/system/core/libutils/
DLooper.cpp152 for (size_t i = 0; i < mRequests.size(); i++) { in rebuildEpollLocked()
153 const Request& request = mRequests.valueAt(i); in rebuildEpollLocked()
288 ssize_t requestIndex = mRequests.indexOfKey(fd); in pollInner()
295 pushResponse(events, mRequests.valueAt(requestIndex)); in pollInner()
465 ssize_t requestIndex = mRequests.indexOfKey(fd); in addFd()
472 mRequests.add(fd, request); in addFd()
507 mRequests.replaceValueAt(requestIndex, request); in addFd()
524 ssize_t requestIndex = mRequests.indexOfKey(fd); in removeFd()
530 if (seq != -1 && mRequests.valueAt(requestIndex).seq != seq) { in removeFd()
533 this, mRequests.valueAt(requestIndex).seq); in removeFd()
[all …]
/system/core/libutils/include/utils/
DLooper.h467 KeyedVector<int, Request> mRequests; // guarded by mLock variable