/system/core/libmemunreachable/ |
H A D | HeapWalker.cpp | 31 bool HeapWalker::Allocation(uintptr_t begin, uintptr_t end) { argument 32 if (end == begin) { 33 end = begin + 1; 35 Range range{begin, end}; 38 valid_allocations_range_.begin = std::min(valid_allocations_range_.begin, begin); 46 reinterpret_cast<void*>(begin), 48 reinterpret_cast<void*>(overlap.begin), 62 if (value >= valid_allocations_range_.begin 88 Root(uintptr_t begin, uintptr_t end) argument [all...] |
H A D | ProcessMappings.h | 23 uintptr_t begin; member in struct:Mapping
|
H A D | HeapWalker.h | 28 // A range [begin, end) 30 uintptr_t begin; member in struct:Range 33 size_t size() const { return end - begin; }; 35 return this->begin == other.begin && this->end == other.end; 45 return a.end <= b.begin; 56 valid_allocations_range_.begin = ~valid_allocations_range_.end; 65 bool Allocation(uintptr_t begin, uintptr_t end); 66 void Root(uintptr_t begin, uintptr_t end); 108 uintptr_t begin local [all...] |
H A D | MemUnreachable.cpp | 72 malloc_iterate(heap_mapping.begin, heap_mapping.end - heap_mapping.begin, 91 for (auto it = heap_mappings.begin(); it != heap_mappings.end(); it++) { 92 ALOGV("Heap mapping %" PRIxPTR "-%" PRIxPTR " %s", it->begin, it->end, it->name); 98 for (auto it = anon_mappings.begin(); it != anon_mappings.end(); it++) { 99 ALOGV("Anon mapping %" PRIxPTR "-%" PRIxPTR " %s", it->begin, it->end, it->name); 100 heap_walker_.Allocation(it->begin, it->end); 103 for (auto it = globals_mappings.begin(); it != globals_mappings.end(); it++) { 104 ALOGV("Globals mapping %" PRIxPTR "-%" PRIxPTR " %s", it->begin, it->end, it->name); 105 heap_walker_.Root(it->begin, i 413 oss << std::hex << begin; local [all...] |
/system/tools/hidl/ |
H A D | Location.h | 51 Location (Position begin, Position end) argument 52 : mBegin(begin), mEnd(end) {} 53 inline const Position &begin() const { return mBegin; } function in struct:android::Location 71 ostr << loc.begin(); 72 if (loc.begin().filename() != last.filename()) { 74 } else if (loc.begin().line() != last.line()) { 76 } else if (loc.begin().column() != last.column()) {
|
/system/netd/server/ |
H A D | UidRanges.cpp | 40 auto iter = std::lower_bound(mRanges.begin(), mRanges.end(), UidRange(intUid, intUid)); 42 (iter != mRanges.begin() && (--iter)->getStop() >= intUid); 86 std::sort(mRanges.begin(), mRanges.end()); 92 std::sort(mRanges.begin(), mRanges.end()); 96 auto middle = mRanges.insert(mRanges.end(), other.mRanges.begin(), other.mRanges.end()); 97 std::inplace_merge(mRanges.begin(), middle, mRanges.end()); 101 auto end = std::set_difference(mRanges.begin(), mRanges.end(), other.mRanges.begin(), 102 other.mRanges.end(), mRanges.begin());
|
/system/bt/service/common/bluetooth/ |
H A D | uuid.cc | 105 std::reverse_copy(uuid.uu, uuid.uu + sizeof(uuid.uu), id_.begin()); 111 std::copy(uuid.begin(), uuid.end(), id_.begin() + kNumBytes16); 116 std::copy(uuid.begin(), uuid.end(), id_.begin()); 125 std::reverse_copy(id_.begin(), id_.end(), ret.begin()); 131 std::reverse_copy(id_.begin(), id_.end(), ret.uu); 152 return std::lexicographical_compare(id_.begin(), id_.end(), rhs.id_.begin(), [all...] |
/system/core/libsysutils/src/ |
H A D | SocketListener.cpp | 67 for (it = mClients->begin(); it != mClients->end();) { 139 for (it = mClients->begin(); it != mClients->end();) { 176 for (it = mClients->begin(); it != mClients->end(); ++it) { 218 for (it = mClients->begin(); it != mClients->end(); ++it) { 233 it = pendingList.begin(); 253 for (it = mClients->begin(); it != mClients->end(); ++it) { 280 for (i = mClients->begin(); i != mClients->end(); ++i) { 289 i = safeList.begin(); 308 for (i = mClients->begin(); i != mClients->end(); ++i) { 317 i = safeList.begin(); [all...] |
/system/extras/perfprofd/quipper/ |
H A D | address_mapper.cc | 52 for (iter = mappings_.begin(); iter != mappings_.end(); ++iter) { 114 if (mappings_.begin()->mapped_addr >= range.size) { 116 range.unmapped_space_after = mappings_.begin()->mapped_addr - range.size; 123 for (iter = mappings_.begin(); iter != mappings_.end(); ++iter) { 145 for (it = mappings_.begin(); it != mappings_.end(); ++it) { 157 for (iter = mappings_.begin(); iter != mappings_.end(); ++iter) { 172 for (iter = mappings_.begin(); iter != mappings_.end(); ++iter) { 186 uint64_t min = mappings_.begin()->mapped_addr; 201 for (iter = mappings_.begin(); iter != mappings_.end(); ++iter) { 205 if (iter != mappings_.begin()) { [all...] |
/system/keymaster/ |
H A D | key_blob_test.cpp | 104 EXPECT_EQ(serialized_blob_.end(), std::search(serialized_blob_.begin(), serialized_blob_.end(), 105 key_material_.begin(), key_material_.end())); 106 EXPECT_NE(serialized_blob_.end(), std::search(serialized_blob_.begin(), serialized_blob_.end(), 107 ciphertext_.begin(), ciphertext_.end())); 124 EXPECT_EQ(0, memcmp(plaintext.begin(), key_material_.begin(), plaintext.key_material_size)); 143 std::search(serialized_blob_.begin(), serialized_blob_.end(), nonce_.begin(), nonce_.end()); 146 std::search(nonce_ptr + 1, serialized_blob_.end(), nonce_.begin(), nonce_.end())); 160 std::search(serialized_blob_.begin(), serialized_blob [all...] |
/system/core/logcat/tests/ |
H A D | logcat_benchmark.cpp | 23 static const char begin[] = "--------- beginning of "; variable 84 if (!strncmp(begin, buffer, sizeof(begin) - 1)) {
|
/system/extras/ioshark/ |
H A D | collect-straces.sh | 37 if [ $i != trace.begin ] && [ $i != trace.tar ]; 46 begin_time=`cat trace.begin` 49 awk -v begin="$begin_time" '{ printf "%f strace ", $1 - begin; $1=""; print $0}' foo > bar 79 adb shell "date +%s > /data/local/tmp/trace.begin ; strace -p $pid1,$pid2 -o /data/local/tmp/trace -q -qq -f -ff -y -ttt -e trace=mmap2,read,write,pread64,pwrite64,fsync,fdatasync,openat,close,lseek,_llseek"
|
/system/update_engine/payload_generator/ |
H A D | extent_ranges.cc | 86 for (ExtentSet::iterator it = extent_set_.begin(), e = extent_set_.end(); 130 for (ExtentSet::iterator it = extent_set_.begin(), e = extent_set_.end(); 143 for (ExtentSet::iterator jt = subtraction.begin(), je = subtraction.end(); 150 extent_set_.insert(new_extents.begin(), new_extents.end()); 155 for (ExtentSet::const_iterator it = ranges.extent_set_.begin(), 162 for (ExtentSet::const_iterator it = ranges.extent_set_.begin(), 169 for (vector<Extent>::const_iterator it = extents.begin(), e = extents.end(); 176 for (vector<Extent>::const_iterator it = extents.begin(), e = extents.end(); 199 if (lower != extent_set_.begin()) 215 for (ExtentSet::const_iterator it = extent_set_.begin(), [all...] |
/system/core/include/backtrace/ |
H A D | BacktraceMap.h | 85 iterator begin() { return maps_.begin(); } function in class:BacktraceMap 89 const_iterator begin() const { return maps_.begin(); } function in class:BacktraceMap
|
/system/core/libbacktrace/include/backtrace/ |
H A D | BacktraceMap.h | 85 iterator begin() { return maps_.begin(); } function in class:BacktraceMap 89 const_iterator begin() const { return maps_.begin(); } function in class:BacktraceMap
|
/system/core/libprocinfo/ |
H A D | process_test.cpp | 73 ASSERT_EQ(1, std::count(vec.begin(), vec.end(), main_tid)); 74 ASSERT_EQ(1, std::count(vec.begin(), vec.end(), thread_tid)); 80 ASSERT_EQ(1, std::count(set.begin(), set.end(), main_tid)); 81 ASSERT_EQ(1, std::count(set.begin(), set.end(), thread_tid));
|
/system/core/libutils/ |
H A D | String16.cpp | 108 String16::String16(const String16& o, size_t len, size_t begin) argument 111 setTo(o, len, begin); 176 status_t String16::setTo(const String16& other, size_t len, size_t begin) argument 179 if (begin >= N) { 184 if ((begin+len) > N) len = N-begin; 185 if (begin == 0 && len == N) { 194 return setTo(other.string()+begin, len); 391 status_t String16::remove(size_t len, size_t begin) argument 394 if (begin > [all...] |
/system/tools/hidl/utils/include/hidl-util/ |
H A D | Formatter.h | 104 // out.join(v.begin(), v.end(), ",", [&](const auto &e) { 108 Formatter &join(const I begin, const I end, const std::string &separator, 154 Formatter &Formatter::join(const I begin, const I end, const std::string &separator, argument 156 for (I iter = begin; iter != end; ++iter) { 157 if (iter != begin) {
|
/system/core/logd/ |
H A D | LogWhiteBlackList.cpp | 59 for (it = mNice.begin(); it != mNice.end();) { 62 for (it = mNaughty.begin(); it != mNaughty.end();) { 71 for (it = mNice.begin(); it != mNice.end();) { 74 for (it = mNaughty.begin(); it != mNaughty.end();) { 185 PruneCollection::iterator it = list->begin(); 234 for (it = mNice.begin(); it != mNice.end(); ++it) { 241 for (it = mNaughty.begin(); it != mNaughty.end(); ++it) { 255 for (it = mNaughty.begin(); it != mNaughty.end(); ++it) { 265 for (it = mNice.begin(); it != mNice.end(); ++it) {
|
/system/chre/util/include/chre/util/ |
H A D | fixed_size_vector.h | 161 typename FixedSizeVector<ElementType, kCapacity>::iterator begin(); 162 typename FixedSizeVector<ElementType, kCapacity>::const_iterator begin() const;
|
H A D | priority_queue.h | 158 typename PriorityQueue<ElementType, CompareFunction>::iterator begin(); 159 typename PriorityQueue<ElementType, CompareFunction>::const_iterator begin() const;
|
/system/core/base/include/android-base/ |
H A D | strings.h | 46 result << *things.begin(); 47 for (auto it = std::next(things.begin()); it != things.end(); ++it) {
|
/system/core/base/ |
H A D | parsenetaddress.cpp | 33 size_t colons = std::count(address.begin(), address.end(), ':'); 34 size_t dots = std::count(address.begin(), address.end(), '.');
|
/system/core/include/sysutils/ |
H A D | List.h | 169 insert(begin(), src.begin(), src.end()); 186 return size_t(distance(begin(), end())); 194 inline iterator begin() { function in class:android::sysutils::List 197 inline const_iterator begin() const { function in class:android::sysutils::List 208 void push_front(const T& val) { insert(begin(), val); } 318 iterator firstDst = begin(); 320 const_iterator firstSrc = right.begin();
|
/system/core/include/utils/ |
H A D | List.h | 168 insert(begin(), src.begin(), src.end()); 185 return size_t(distance(begin(), end())); 193 inline iterator begin() { function in class:android::List 196 inline const_iterator begin() const { function in class:android::List 207 void push_front(const T& val) { insert(begin(), val); } 317 iterator firstDst = begin(); 319 const_iterator firstSrc = right.begin();
|