/system/core/libpixelflinger/arch-arm64/ |
H A D | t32cb16blend.S | 166 last: label 210 b last
|
/system/core/libpixelflinger/ |
H A D | t32cb16blend.S | 153 last: label 203 b last
|
/system/core/logcat/ |
H A D | logcatd_main.cpp | 32 // Save and detect presence of -L or --last flag 34 bool last = false; local 38 if (!strcmp(argv[i], "-L") || !strcmp(argv[i], "--last")) last = true; 47 if (last) { 51 // Remove -L and --last flags from argument list 54 if (!*it || (strcmp(*it, "-L") && strcmp(*it, "--last"))) {
|
/system/core/liblog/ |
H A D | log_ratelimit.cpp | 25 // Global default if 'last' argument in __android_log_ratelimit is NULL 30 // provides their own 'last' argument, then they can play such games 36 // Lock to protect last_clock and last_seconds, but also 'last' 40 // if last is NULL, caller _must_ provide a consistent value for 45 LIBLOG_ABI_PUBLIC int __android_log_ratelimit(time_t seconds, time_t* last) { argument 67 if (!last) { 73 last = &g_last_clock; 77 if ((now == (time_t)-1) || ((*last + seconds) > now)) { 82 *last = now;
|
H A D | local_logger.c | 110 * LOG_ID_KERNEL = 6, // place last, third-parties can not use it 130 struct listnode* last[NUMBER_OF_LOG_BUFFERS]; /* init &head */ member in struct:LogBuffer 144 log->last[i] = &log->head; 165 log->last[i] = &log->head; 194 if (log->last[logId] == &log->head) { 195 log->last[logId] = list_tail(&log->head); 198 struct listnode* node = log->last[logId]; 222 log->last[logId] = node->prev; 225 LOG_ALWAYS_FATAL_IF(node == log->last[logId], "corrupted list"); 475 logbuf.last[logI [all...] |
H A D | pmsg_reader.c | 327 const char *prev = NULL, *last = NULL, *cp = prefix; local 329 prev = last; 330 last = cp; 445 * pmsg FIFO but retaining the newest data for last with best
|
/system/core/debuggerd/ |
H A D | debuggerd_benchmark.cpp | 50 auto last = begin; local 55 auto diff = now - last; 60 last = now;
|
/system/core/libunwindstack/ |
H A D | DwarfEhFrameWithHdr.cpp | 123 size_t last = total_entries; local 124 while (first < last) { 125 size_t current = (first + last) / 2; 135 last = current; 140 if (last != 0) { 141 const FdeInfo* info = GetFdeInfoFromIndex(last - 1);
|
H A D | ElfInterfaceArm.cpp | 36 size_t last = total_entries_; local 37 while (first < last) { 38 size_t current = (first + last) / 2; 51 last = current; 56 if (last != 0) { 57 *entry_offset = start_offset_ + (last - 1) * 8;
|
H A D | Symbols.cpp | 41 size_t last = symbols_.size(); local 42 while (first < last) { 43 size_t current = first + (last - first) / 2; 46 last = current;
|
H A D | Maps.cpp | 44 size_t last = maps_.size(); local 45 while (first < last) { 46 size_t index = (first + last) / 2; 51 last = index;
|
H A D | DwarfSection.cpp | 876 size_t last = fde_count_; local 877 while (first < last) { 878 size_t current = (first + last) / 2; 886 last = current;
|
/system/tools/hidl/ |
H A D | Location.cpp | 100 Position last = Position(loc.end().filename(), loc.end().line(), local 103 if (loc.begin().filename() != last.filename()) { 104 ostr << "-" << last; local 105 } else if (loc.begin().line() != last.line()) { 106 ostr << "-" << last.line() << "." << last.column(); 107 } else if (loc.begin().column() != last.column()) { 108 ostr << "-" << last.column();
|
/system/tools/hidl/c2hal/ |
H A D | Type.cpp | 247 Qualifier *last = (*mQualifiers)[mQualifiers->size() - 1]; local 249 if(last == NULL || last->qualification != Qualifier::ID) { 253 std::string ret{last->id};
|
/system/core/adb/ |
H A D | socket_test.cpp | 51 int last[2]; local 59 ASSERT_EQ(0, adb_socketpair(last)) << strerror(errno); 82 asocket* end = create_local_socket(last[0]); 93 ASSERT_TRUE(ReadFdExactly(last[1], &write_buffer[0], write_buffer.size())); 98 ASSERT_EQ(0, adb_close(last[1]));
|
/system/extras/showmap/ |
H A D | showmap.cpp | 279 mapinfo* last = mi; local 301 free(last);
|
/system/extras/simpleperf/ |
H A D | SampleDisplayer.h | 136 uint64_t parent_period, bool last) { 151 if (last) { 134 DisplayCallGraphEntry(FILE* fp, size_t depth, std::string prefix, const std::unique_ptr<CallChainNodeT>& node, uint64_t parent_period, bool last) argument
|
/system/netd/server/ |
H A D | BandwidthControllerTest.cpp | 434 bool last = (iface == ifaces[1]); local 435 auto expected = removeInterfaceSharedQuotaCommands(iface, kQuota, last);
|
/system/core/include/sysutils/ |
H A D | List.h | 190 * 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) 239 iterator erase(iterator first, iterator last) { argument 240 while (first != last) 242 return iterator(last); 261 * will be equal to "last". The iterators must refer to the same 275 _ListIterator<U, CL> first, _ListIterator<U, CR> last) const 278 while (first != last) {
|
/system/core/include/utils/ |
H A D | List.h | 191 * 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) 240 iterator erase(iterator first, iterator last) { argument 241 while (first != last) 243 return iterator(last); 262 * will be equal to "last". The iterators must refer to the same 276 _ListIterator<U, CL> first, _ListIterator<U, CR> last) const 279 while (first != last) {
|
/system/core/libsysutils/include/sysutils/ |
H A D | List.h | 190 * 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) 239 iterator erase(iterator first, iterator last) { argument 240 while (first != last) 242 return iterator(last); 261 * will be equal to "last". The iterators must refer to the same 275 _ListIterator<U, CL> first, _ListIterator<U, CR> last) const 278 while (first != last) {
|
/system/core/libutils/include/utils/ |
H A D | List.h | 191 * 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) 240 iterator erase(iterator first, iterator last) { argument 241 while (first != last) 243 return iterator(last); 262 * will be equal to "last". The iterators must refer to the same 276 _ListIterator<U, CL> first, _ListIterator<U, CR> last) const 279 while (first != last) {
|
/system/keymaster/include/keymaster/ |
H A D | List.h | 189 * 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) 238 iterator erase(iterator first, iterator last) { argument 239 while (first != last) 241 return iterator(last); 260 * will be equal to "last". The iterators must refer to the same 274 _ListIterator<U, CL> first, _ListIterator<U, CR> last) const 277 while (first != last) {
|
/system/bt/stack/a2dp/ |
H A D | a2dp_vendor_ldac.cc | 179 // |last| is true for the last packet of a fragmented frame. 183 bool start, bool last, 190 if (last) *p_dst |= A2DP_LDAC_HDR_L_MSK; 182 A2DP_BuildMediaPayloadHeaderLdac(uint8_t* p_dst, bool frag, bool start, bool last, uint8_t num) argument
|
/system/core/debuggerd/libdebuggerd/ |
H A D | tombstone.cpp | 174 size_t first = 0, last; local 181 last = i; 196 for (size_t i = first; i <= last; i++) { 202 if (i == last) { 456 // If "tail" is non-zero, log the last "tail" number of lines.
|