Searched defs:sorted (Results 1 - 3 of 3) sorted by relevance

/system/core/logd/
H A DLogStatistics.cpp277 std::unique_ptr<const UidEntry *[]> sorted = sort(maximum_sorted_entries, id); local
279 while ((index = uidTable_t::next(index, sorted, maximum_sorted_entries)) >= 0) {
280 const UidEntry *entry = sorted[index];
340 std::unique_ptr<const PidEntry *[]> sorted = pidTable.sort(maximum_sorted_entries); local
342 while ((index = pidTable.next(index, sorted, maximum_sorted_entries)) >= 0) {
343 const PidEntry *entry = sorted[index];
399 std::unique_ptr<const TidEntry *[]> sorted = tidTable.sort(maximum_sorted_entries); local
401 while ((index = tidTable.next(index, sorted, maximum_sorted_entries)) >= 0) {
402 const TidEntry *entry = sorted[index];
455 std::unique_ptr<const TagEntry *[]> sorted local
[all...]
H A DLogStatistics.h44 std::unique_ptr<const TEntry *[]> sorted(NULL);
45 return sorted;
65 std::unique_ptr<const TEntry *[]> sorted(retval);
66 return sorted;
70 static ssize_t next(ssize_t index, std::unique_ptr<const TEntry *[]> &sorted, size_t n) { argument
72 if (!sorted.get() || (index < 0) || (n <= (size_t)index) || !sorted[index]
73 || (sorted[index]->getSizes() <= (sorted[0]->getSizes() / 100))) {
H A DLogBuffer.cpp166 // Insert elements in time sorted order if possible
431 std::unique_ptr<const UidEntry *[]> sorted = stats.sort(2, id); local
433 if (sorted.get()) {
434 if (sorted[0] && sorted[1]) {
435 worst_sizes = sorted[0]->getSizes();
441 && (worst_sizes > (10 * sorted[0]->getDropped()))) {
442 worst = sorted[0]->getKey();
443 second_worst_sizes = sorted[1]->getSizes();
703 // we are better off starting from the end of the time sorted lis
[all...]

Completed in 658 milliseconds