Searched refs:first (Results 1 - 25 of 216) sorted by relevance

123456789

/system/core/
H A DAndroid.mk18 include $(call first-makefiles-under,$(LOCAL_PATH))
/system/core/liblog/
H A DAndroid.mk3 include $(call first-makefiles-under,$(LOCAL_PATH))
/system/core/logcat/
H A DAndroid.mk5 include $(call first-makefiles-under,$(LOCAL_PATH))
/system/core/libziparchive/
H A Dentry_name_utils-inl.h38 for (uint8_t first = byte << 1; first & 0x80; first <<= 1) {
/system/bt/service/
H A Dsettings.cc37 if (iter.first == switches::kCreateIPCSocketPath) {
47 } else if (iter.first == switches::kAndroidIPCSocketSuffix) {
57 } else if (iter.first == switches::kEnableOnStart) {
70 else if (iter.first != ::switches::kV) {
71 LOG(ERROR) << "Unexpected command-line switches found: " << iter.first;
/system/nvram/messages/
H A Dblob.cpp43 void swap(Blob& first, Blob& second) { argument
46 uint8_t* data_tmp = first.data_;
47 size_t size_tmp = first.size_;
48 first.data_ = second.data_;
49 first.size_ = second.size_;
/system/tools/hidl/
H A DHidlTypeAssertion.cpp46 return a.first < b.first;
51 << entry.first
/system/core/logd/
H A DAndroid.mk13 include $(call first-makefiles-under,$(LOCAL_PATH))
/system/extras/memtrack/
H A Dmemtrack.cpp198 if (all_.count(it->first) == 0) {
200 all_[it->first].num_samples = 0;
201 all_[it->first].name = it->first;
202 all_[it->first].avg_pss_kb = 0;
203 all_[it->first].min_pss_kb = 0;
204 all_[it->first].max_pss_kb = 0;
207 if (it->second.pids.size() > all_[it->first].max_num_pids) {
208 all_[it->first].max_num_pids = it->second.pids.size();
211 all_[it->first]
230 comparePss(const process_info_t *first, const process_info_t *second) argument
[all...]
/system/extras/tests/lib/testUtil/
H A DtestUtil.c99 // second, is later than the time pointed to by first.
100 struct timespec tsDelta(const struct timespec *first, argument
105 assert(first != NULL);
107 assert(first->tv_nsec >= 0 && first->tv_nsec < nSecsPerSec);
109 rv.tv_sec = second->tv_sec - first->tv_sec;
110 if (second->tv_nsec >= first->tv_nsec) {
111 rv.tv_nsec = second->tv_nsec - first->tv_nsec;
113 rv.tv_nsec = (second->tv_nsec + nSecsPerSec) - first->tv_nsec;
122 // second, is later than the time pointed to by first
123 tvDelta(const struct timeval *first, const struct timeval *second) argument
[all...]
/system/update_engine/payload_consumer/
H A Dfake_file_descriptor.cc25 // Check for the EOF condition first to avoid reporting it as a failure.
28 // Find the first offset greater or equal than the current position where a
34 if (failure.first <= offset_ && offset_ < failure.first + failure.second) {
38 if (failure.first > offset_)
39 first_failure = std::min(first_failure, failure.first);
/system/extras/tests/lib/testUtil/include/
H A DtestUtil.h32 struct timespec tsDelta(const struct timespec *first,
34 struct timeval tvDelta(const struct timeval *first,
/system/chre/util/include/chre/util/
H A Dmemory.h25 * Destroys count objects starting at first. This function is similar to
28 * @param first Starting address of count objects to destroy
32 void destroy(ElementType *first, size_t count);
/system/core/debuggerd/libdebuggerd/test/
H A Dopen_files_list_test.cpp42 if (file.first == tf.fd) {
/system/core/include/sysutils/
H A DList.h190 * Return the first element or one past the last element. The
223 void insert(iterator posn, const_iterator first, const_iterator last) { argument
224 for ( ; first != last; ++first)
225 insert(posn, *first);
239 iterator erase(iterator first, iterator last) { argument
240 while (first != last)
241 erase(first++); // don't erase than incr later!
260 * Measure the distance between two iterators. On exist, "first"
275 _ListIterator<U, CL> first, _ListIterato
274 distance( _ListIterator<U, CL> first, _ListIterator<U, CR> last) const argument
[all...]
/system/core/include/utils/
H A DList.h191 * Return the first element or one past the last element. The
224 void insert(iterator posn, const_iterator first, const_iterator last) { argument
225 for ( ; first != last; ++first)
226 insert(posn, *first);
240 iterator erase(iterator first, iterator last) { argument
241 while (first != last)
242 erase(first++); // don't erase than incr later!
261 * Measure the distance between two iterators. On exist, "first"
276 _ListIterator<U, CL> first, _ListIterato
275 distance( _ListIterator<U, CL> first, _ListIterator<U, CR> last) const argument
[all...]
/system/core/libsysutils/include/sysutils/
H A DList.h190 * Return the first element or one past the last element. The
223 void insert(iterator posn, const_iterator first, const_iterator last) { argument
224 for ( ; first != last; ++first)
225 insert(posn, *first);
239 iterator erase(iterator first, iterator last) { argument
240 while (first != last)
241 erase(first++); // don't erase than incr later!
260 * Measure the distance between two iterators. On exist, "first"
275 _ListIterator<U, CL> first, _ListIterato
274 distance( _ListIterator<U, CL> first, _ListIterator<U, CR> last) const argument
[all...]
/system/core/libutils/include/utils/
H A DList.h191 * Return the first element or one past the last element. The
224 void insert(iterator posn, const_iterator first, const_iterator last) { argument
225 for ( ; first != last; ++first)
226 insert(posn, *first);
240 iterator erase(iterator first, iterator last) { argument
241 while (first != last)
242 erase(first++); // don't erase than incr later!
261 * Measure the distance between two iterators. On exist, "first"
276 _ListIterator<U, CL> first, _ListIterato
275 distance( _ListIterator<U, CL> first, _ListIterator<U, CR> last) const argument
[all...]
/system/keymaster/include/keymaster/
H A DList.h189 * Return the first element or one past the last element. The
222 void insert(iterator posn, const_iterator first, const_iterator last) { argument
223 for ( ; first != last; ++first)
224 insert(posn, *first);
238 iterator erase(iterator first, iterator last) { argument
239 while (first != last)
240 erase(first++); // don't erase than incr later!
259 * Measure the distance between two iterators. On exist, "first"
274 _ListIterator<U, CL> first, _ListIterato
273 distance( _ListIterator<U, CL> first, _ListIterator<U, CR> last) const argument
[all...]
/system/update_engine/payload_generator/
H A Dsquashfs_filesystem.cc162 for (auto first = files_.begin(), second = first + 1;
163 first != files_.end() && second != files_.end();
164 second = first + 1) {
165 auto first_begin = first->extents[0].start_block();
166 auto first_end = first_begin + first->extents[0].num_blocks();
169 // Remove the first file if the size is zero.
171 first = files_.erase(first);
174 // Second file is inside the first fil
[all...]
/system/core/libmemunreachable/
H A DHeapWalker.cpp45 Range overlap = inserted.first->first;
65 *range = it->first;
128 leak_bytes += it->first.end - it->first.begin;
136 leaked.push_back(it->first);
/system/tools/hidl/docs/src/parser/elements/declarations/
H A DCompoundDeclarationParser.kt66 if (statementTokens.first().identifier == TokenGrammar.DOC_START) {
77 when(statementTokens.first().identifier) {
79 assert(statementTokens.first().category == TokenCategory.TypeDef)
81 typeDef = statementTokens.first().identifier,
91 type = statementTokens.first().value,
99 type = statementTokens.first().value,
/system/bt/vendor_libs/linux/interface/
H A Dasync_fd_watcher.cc132 FD_SET(it.first, &read_fds);
133 max_read_fd = std::max(max_read_fd, it.first);
177 if (FD_ISSET(it.first, &read_fds)) {
178 it.second(it.first);
/system/core/gatekeeperd/
H A DAndroid.mk47 include $(call first-makefiles-under,$(LOCAL_PATH))
/system/update_engine/update_manager/
H A Devaluation_context.cc90 if (it.first->GetMode() == kVariableModeAsync)
91 it.first->RemoveObserver(this);
151 if (it->first->GetMode() == kVariableModeConst) {
187 switch (it.first->GetMode()) {
189 DLOG(INFO) << "Waiting for value on " << it.first->GetName();
190 it.first->AddObserver(this);
194 timeout = std::min(timeout, it.first->GetPollInterval());
233 variables->SetString(it.first->GetName(), it.second.ToString());

Completed in 568 milliseconds

123456789