Project import
diff --git a/procrank/Android.mk b/procrank/Android.mk new file mode 100644 index 0000000..8a235fd --- /dev/null +++ b/procrank/Android.mk
@@ -0,0 +1,24 @@ +# Copyright (C) 2008 The Android Open Source Project +# +# Licensed under the Apache License, Version 2.0 (the "License"); +# you may not use this file except in compliance with the License. +# You may obtain a copy of the License at +# +# http://www.apache.org/licenses/LICENSE-2.0 +# +# Unless required by applicable law or agreed to in writing, software +# distributed under the License is distributed on an "AS IS" BASIS, +# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. +# See the License for the specific language governing permissions and +# limitations under the License. + +LOCAL_PATH:= $(call my-dir) + +include $(CLEAR_VARS) +LOCAL_SRC_FILES := procrank.cpp +LOCAL_CFLAGS := -Wall -Wextra -Wformat=2 -Werror +LOCAL_SHARED_LIBRARIES := libpagemap libbase +LOCAL_MODULE := procrank +LOCAL_MODULE_PATH := $(TARGET_OUT_OPTIONAL_EXECUTABLES) +LOCAL_MODULE_TAGS := debug +include $(BUILD_EXECUTABLE)
diff --git a/procrank/MODULE_LICENSE_APACHE2 b/procrank/MODULE_LICENSE_APACHE2 new file mode 100644 index 0000000..e69de29 --- /dev/null +++ b/procrank/MODULE_LICENSE_APACHE2
diff --git a/procrank/NOTICE b/procrank/NOTICE new file mode 100644 index 0000000..c5b1efa --- /dev/null +++ b/procrank/NOTICE
@@ -0,0 +1,190 @@ + + Copyright (c) 2005-2008, The Android Open Source Project + + Licensed under the Apache License, Version 2.0 (the "License"); + you may not use this file except in compliance with the License. + + Unless required by applicable law or agreed to in writing, software + distributed under the License is distributed on an "AS IS" BASIS, + WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. + See the License for the specific language governing permissions and + limitations under the License. + + + Apache License + Version 2.0, January 2004 + http://www.apache.org/licenses/ + + TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION + + 1. Definitions. + + "License" shall mean the terms and conditions for use, reproduction, + and distribution as defined by Sections 1 through 9 of this document. + + "Licensor" shall mean the copyright owner or entity authorized by + the copyright owner that is granting the License. + + "Legal Entity" shall mean the union of the acting entity and all + other entities that control, are controlled by, or are under common + control with that entity. For the purposes of this definition, + "control" means (i) the power, direct or indirect, to cause the + direction or management of such entity, whether by contract or + otherwise, or (ii) ownership of fifty percent (50%) or more of the + outstanding shares, or (iii) beneficial ownership of such entity. + + "You" (or "Your") shall mean an individual or Legal Entity + exercising permissions granted by this License. + + "Source" form shall mean the preferred form for making modifications, + including but not limited to software source code, documentation + source, and configuration files. + + "Object" form shall mean any form resulting from mechanical + transformation or translation of a Source form, including but + not limited to compiled object code, generated documentation, + and conversions to other media types. + + "Work" shall mean the work of authorship, whether in Source or + Object form, made available under the License, as indicated by a + copyright notice that is included in or attached to the work + (an example is provided in the Appendix below). + + "Derivative Works" shall mean any work, whether in Source or Object + form, that is based on (or derived from) the Work and for which the + editorial revisions, annotations, elaborations, or other modifications + represent, as a whole, an original work of authorship. For the purposes + of this License, Derivative Works shall not include works that remain + separable from, or merely link (or bind by name) to the interfaces of, + the Work and Derivative Works thereof. + + "Contribution" shall mean any work of authorship, including + the original version of the Work and any modifications or additions + to that Work or Derivative Works thereof, that is intentionally + submitted to Licensor for inclusion in the Work by the copyright owner + or by an individual or Legal Entity authorized to submit on behalf of + the copyright owner. For the purposes of this definition, "submitted" + means any form of electronic, verbal, or written communication sent + to the Licensor or its representatives, including but not limited to + communication on electronic mailing lists, source code control systems, + and issue tracking systems that are managed by, or on behalf of, the + Licensor for the purpose of discussing and improving the Work, but + excluding communication that is conspicuously marked or otherwise + designated in writing by the copyright owner as "Not a Contribution." + + "Contributor" shall mean Licensor and any individual or Legal Entity + on behalf of whom a Contribution has been received by Licensor and + subsequently incorporated within the Work. + + 2. Grant of Copyright License. Subject to the terms and conditions of + this License, each Contributor hereby grants to You a perpetual, + worldwide, non-exclusive, no-charge, royalty-free, irrevocable + copyright license to reproduce, prepare Derivative Works of, + publicly display, publicly perform, sublicense, and distribute the + Work and such Derivative Works in Source or Object form. + + 3. Grant of Patent License. Subject to the terms and conditions of + this License, each Contributor hereby grants to You a perpetual, + worldwide, non-exclusive, no-charge, royalty-free, irrevocable + (except as stated in this section) patent license to make, have made, + use, offer to sell, sell, import, and otherwise transfer the Work, + where such license applies only to those patent claims licensable + by such Contributor that are necessarily infringed by their + Contribution(s) alone or by combination of their Contribution(s) + with the Work to which such Contribution(s) was submitted. If You + institute patent litigation against any entity (including a + cross-claim or counterclaim in a lawsuit) alleging that the Work + or a Contribution incorporated within the Work constitutes direct + or contributory patent infringement, then any patent licenses + granted to You under this License for that Work shall terminate + as of the date such litigation is filed. + + 4. Redistribution. You may reproduce and distribute copies of the + Work or Derivative Works thereof in any medium, with or without + modifications, and in Source or Object form, provided that You + meet the following conditions: + + (a) You must give any other recipients of the Work or + Derivative Works a copy of this License; and + + (b) You must cause any modified files to carry prominent notices + stating that You changed the files; and + + (c) You must retain, in the Source form of any Derivative Works + that You distribute, all copyright, patent, trademark, and + attribution notices from the Source form of the Work, + excluding those notices that do not pertain to any part of + the Derivative Works; and + + (d) If the Work includes a "NOTICE" text file as part of its + distribution, then any Derivative Works that You distribute must + include a readable copy of the attribution notices contained + within such NOTICE file, excluding those notices that do not + pertain to any part of the Derivative Works, in at least one + of the following places: within a NOTICE text file distributed + as part of the Derivative Works; within the Source form or + documentation, if provided along with the Derivative Works; or, + within a display generated by the Derivative Works, if and + wherever such third-party notices normally appear. The contents + of the NOTICE file are for informational purposes only and + do not modify the License. You may add Your own attribution + notices within Derivative Works that You distribute, alongside + or as an addendum to the NOTICE text from the Work, provided + that such additional attribution notices cannot be construed + as modifying the License. + + You may add Your own copyright statement to Your modifications and + may provide additional or different license terms and conditions + for use, reproduction, or distribution of Your modifications, or + for any such Derivative Works as a whole, provided Your use, + reproduction, and distribution of the Work otherwise complies with + the conditions stated in this License. + + 5. Submission of Contributions. Unless You explicitly state otherwise, + any Contribution intentionally submitted for inclusion in the Work + by You to the Licensor shall be under the terms and conditions of + this License, without any additional terms or conditions. + Notwithstanding the above, nothing herein shall supersede or modify + the terms of any separate license agreement you may have executed + with Licensor regarding such Contributions. + + 6. Trademarks. This License does not grant permission to use the trade + names, trademarks, service marks, or product names of the Licensor, + except as required for reasonable and customary use in describing the + origin of the Work and reproducing the content of the NOTICE file. + + 7. Disclaimer of Warranty. Unless required by applicable law or + agreed to in writing, Licensor provides the Work (and each + Contributor provides its Contributions) on an "AS IS" BASIS, + WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or + implied, including, without limitation, any warranties or conditions + of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A + PARTICULAR PURPOSE. You are solely responsible for determining the + appropriateness of using or redistributing the Work and assume any + risks associated with Your exercise of permissions under this License. + + 8. Limitation of Liability. In no event and under no legal theory, + whether in tort (including negligence), contract, or otherwise, + unless required by applicable law (such as deliberate and grossly + negligent acts) or agreed to in writing, shall any Contributor be + liable to You for damages, including any direct, indirect, special, + incidental, or consequential damages of any character arising as a + result of this License or out of the use or inability to use the + Work (including but not limited to damages for loss of goodwill, + work stoppage, computer failure or malfunction, or any and all + other commercial damages or losses), even if such Contributor + has been advised of the possibility of such damages. + + 9. Accepting Warranty or Additional Liability. While redistributing + the Work or Derivative Works thereof, You may choose to offer, + and charge a fee for, acceptance of support, warranty, indemnity, + or other liability obligations and/or rights consistent with this + License. However, in accepting such obligations, You may act only + on Your own behalf and on Your sole responsibility, not on behalf + of any other Contributor, and only if You agree to indemnify, + defend, and hold each Contributor harmless for any liability + incurred by, or claims asserted against, such Contributor by reason + of your accepting any such warranty or additional liability. + + END OF TERMS AND CONDITIONS +
diff --git a/procrank/procrank.cpp b/procrank/procrank.cpp new file mode 100644 index 0000000..cc8c2f1 --- /dev/null +++ b/procrank/procrank.cpp
@@ -0,0 +1,591 @@ +// +// Copyright (C) 2008 The Android Open Source Project +// +// Licensed under the Apache License, Version 2.0 (the "License"); +// you may not use this file except in compliance with the License. +// You may obtain a copy of the License at +// +// http://www.apache.org/licenses/LICENSE-2.0 +// +// Unless required by applicable law or agreed to in writing, software +// distributed under the License is distributed on an "AS IS" BASIS, +// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. +// See the License for the specific language governing permissions and +// limitations under the License. +// + +#include <dirent.h> +#include <errno.h> +#include <fcntl.h> +#include <inttypes.h> +#include <stdbool.h> +#include <stdlib.h> +#include <string.h> +#include <sys/types.h> +#include <unistd.h> + +#include <vector> + +#include <android-base/file.h> +#include <android-base/stringprintf.h> +#include <android-base/strings.h> +#include <pagemap/pagemap.h> + +struct proc_info { + pid_t pid; + pm_memusage_t usage; + uint64_t wss; + int oomadj; +}; + +static void usage(char *myname); +static std::string getprocname(pid_t pid); +static int getoomadj(pid_t pid); +static bool getminfree(std::vector<uint64_t>* minfree, std::vector<int>* adj); +static int numcmp(uint64_t a, uint64_t b); + +#define declare_sort(field) \ + static int sort_by_ ## field (const void *a, const void *b) + +declare_sort(vss); +declare_sort(rss); +declare_sort(pss); +declare_sort(uss); +declare_sort(swap); +declare_sort(oomadj); + +int (*compfn)(const void *a, const void *b); +static int order; + +enum { + MEMINFO_TOTAL, + MEMINFO_FREE, + MEMINFO_BUFFERS, + MEMINFO_CACHED, + MEMINFO_SHMEM, + MEMINFO_SLAB, + MEMINFO_SWAP_TOTAL, + MEMINFO_SWAP_FREE, + MEMINFO_ZRAM_TOTAL, + MEMINFO_MAPPED, + MEMINFO_VMALLOC_USED, + MEMINFO_PAGE_TABLES, + MEMINFO_KERNEL_STACK, + MEMINFO_COUNT +}; + +void get_mem_info(uint64_t mem[]) { + char buffer[1024]; + unsigned int numFound = 0; + + int fd = open("/proc/meminfo", O_RDONLY); + + if (fd < 0) { + printf("Unable to open /proc/meminfo: %s\n", strerror(errno)); + return; + } + + const int len = read(fd, buffer, sizeof(buffer)-1); + close(fd); + + if (len < 0) { + printf("Empty /proc/meminfo"); + return; + } + buffer[len] = 0; + + static const char* const tags[] = { + "MemTotal:", + "MemFree:", + "Buffers:", + "Cached:", + "Shmem:", + "Slab:", + "SwapTotal:", + "SwapFree:", + "ZRam:", // not read from meminfo but from /sys/block/zram0 + "Mapped:", + "VmallocUsed:", + "PageTables:", + "KernelStack:", + NULL + }; + static const int tagsLen[] = { + 9, + 8, + 8, + 7, + 6, + 5, + 10, + 9, + 5, + 7, + 12, + 11, + 12, + 0 + }; + + char* p = buffer; + while (*p && (numFound < (sizeof(tagsLen) / sizeof(tagsLen[0])))) { + int i = 0; + while (tags[i]) { + if (strncmp(p, tags[i], tagsLen[i]) == 0) { + p += tagsLen[i]; + while (*p == ' ') p++; + char* num = p; + while (*p >= '0' && *p <= '9') p++; + if (*p != 0) { + *p = 0; + p++; + } + mem[i] = atoll(num); + numFound++; + break; + } + i++; + } + while (*p && *p != '\n') { + p++; + } + if (*p) p++; + } +} + +int main(int argc, char *argv[]) { + pm_kernel_t *ker; + pm_process_t *proc; + pid_t *pids; + size_t num_procs; + uint64_t total_pss; + uint64_t total_uss; + uint64_t total_swap; + uint64_t total_pswap; + uint64_t total_uswap; + uint64_t total_zswap; + int error; + bool has_swap = false, has_zram = false; + uint64_t required_flags = 0; + uint64_t flags_mask = 0; + + int arg; + size_t i; + + enum { + WS_OFF, + WS_ONLY, + WS_RESET, + } ws; + + uint64_t mem[MEMINFO_COUNT] = { }; + pm_proportional_swap_t *p_swap; + int fd, len; + char buffer[1024]; + float zram_cr = 0.0; + + signal(SIGPIPE, SIG_IGN); + compfn = &sort_by_pss; + order = -1; + ws = WS_OFF; + bool oomadj = false; + + for (arg = 1; arg < argc; arg++) { + if (!strcmp(argv[arg], "-v")) { compfn = &sort_by_vss; continue; } + if (!strcmp(argv[arg], "-r")) { compfn = &sort_by_rss; continue; } + if (!strcmp(argv[arg], "-p")) { compfn = &sort_by_pss; continue; } + if (!strcmp(argv[arg], "-u")) { compfn = &sort_by_uss; continue; } + if (!strcmp(argv[arg], "-s")) { compfn = &sort_by_swap; continue; } + if (!strcmp(argv[arg], "-o")) { compfn = &sort_by_oomadj; oomadj = true; continue; } + if (!strcmp(argv[arg], "-c")) { required_flags = 0; flags_mask = PM_PAGE_SWAPBACKED; continue; } + if (!strcmp(argv[arg], "-C")) { required_flags = flags_mask = PM_PAGE_SWAPBACKED; continue; } + if (!strcmp(argv[arg], "-k")) { required_flags = flags_mask = PM_PAGE_KSM; continue; } + if (!strcmp(argv[arg], "-w")) { ws = WS_ONLY; continue; } + if (!strcmp(argv[arg], "-W")) { ws = WS_RESET; continue; } + if (!strcmp(argv[arg], "-R")) { order *= -1; continue; } + if (!strcmp(argv[arg], "-h")) { usage(argv[0]); exit(0); } + fprintf(stderr, "Invalid argument \"%s\".\n", argv[arg]); + usage(argv[0]); + exit(EXIT_FAILURE); + } + + get_mem_info(mem); + p_swap = pm_memusage_pswap_create(mem[MEMINFO_SWAP_TOTAL] * 1024); + + error = pm_kernel_create(&ker); + if (error) { + fprintf(stderr, "Error creating kernel interface -- " + "does this kernel have pagemap?\n"); + exit(EXIT_FAILURE); + } + + error = pm_kernel_pids(ker, &pids, &num_procs); + if (error) { + fprintf(stderr, "Error listing processes.\n"); + exit(EXIT_FAILURE); + } + + std::vector<proc_info> procs(num_procs); + for (i = 0; i < num_procs; i++) { + procs[i].pid = pids[i]; + procs[i].oomadj = getoomadj(pids[i]); + pm_memusage_zero(&procs[i].usage); + pm_memusage_pswap_init_handle(&procs[i].usage, p_swap); + error = pm_process_create(ker, pids[i], &proc); + if (error) { + fprintf(stderr, "warning: could not create process interface for %d\n", pids[i]); + continue; + } + + switch (ws) { + case WS_OFF: + error = pm_process_usage_flags(proc, &procs[i].usage, flags_mask, + required_flags); + break; + case WS_ONLY: + error = pm_process_workingset(proc, &procs[i].usage, 0); + break; + case WS_RESET: + error = pm_process_workingset(proc, NULL, 1); + break; + } + + if (error) { + fprintf(stderr, "warning: could not read usage for %d\n", pids[i]); + } + + if (ws != WS_RESET && procs[i].usage.swap) { + has_swap = true; + } + + pm_process_destroy(proc); + } + + free(pids); + + if (ws == WS_RESET) exit(0); + + procs.erase(std::remove_if(procs.begin(), + procs.end(), + [](auto proc){ + return proc.usage.vss == 0; + }), + procs.end()); + + qsort(procs.data(), procs.size(), sizeof(procs[0]), compfn); + + if (has_swap) { + fd = open("/sys/block/zram0/mem_used_total", O_RDONLY); + if (fd >= 0) { + len = read(fd, buffer, sizeof(buffer)-1); + close(fd); + if (len > 0) { + buffer[len] = 0; + mem[MEMINFO_ZRAM_TOTAL] = atoll(buffer)/1024; + zram_cr = (float) mem[MEMINFO_ZRAM_TOTAL] / + (mem[MEMINFO_SWAP_TOTAL] - mem[MEMINFO_SWAP_FREE]); + has_zram = true; + } + } + } + + printf("%5s ", "PID"); + if (oomadj) { + printf("%5s ", "oom"); + } + if (ws) { + printf("%7s %7s %7s ", "WRss", "WPss", "WUss"); + if (has_swap) { + printf("%7s %7s %7s ", "WSwap", "WPSwap", "WUSwap"); + if (has_zram) { + printf("%7s ", "WZSwap"); + } + } + } else { + printf("%8s %7s %7s %7s ", "Vss", "Rss", "Pss", "Uss"); + if (has_swap) { + printf("%7s %7s %7s ", "Swap", "PSwap", "USwap"); + if (has_zram) { + printf("%7s ", "ZSwap"); + } + } + } + + printf("%s\n", "cmdline"); + + total_pss = 0; + total_uss = 0; + total_swap = 0; + total_pswap = 0; + total_uswap = 0; + total_zswap = 0; + + std::vector<uint64_t> lmk_minfree; + std::vector<int> lmk_adj; + if (oomadj) { + getminfree(&lmk_minfree, &lmk_adj); + } + auto lmk_minfree_it = lmk_minfree.cbegin(); + auto lmk_adj_it = lmk_adj.cbegin(); + + auto print_oomadj_totals = [&](int adj){ + for (; lmk_adj_it != lmk_adj.cend() && lmk_minfree_it != lmk_minfree.cend() && + adj > *lmk_adj_it; lmk_adj_it++, lmk_minfree_it++) { + // Print the cumulative total line + printf("%5s ", ""); // pid + + printf("%5s ", ""); // oomadj + + if (ws) { + printf("%7s %6" PRIu64 "K %6" PRIu64 "K ", + "", total_pss / 1024, total_uss / 1024); + } else { + printf("%8s %7s %6" PRIu64 "K %6" PRIu64 "K ", + "", "", total_pss / 1024, total_uss / 1024); + } + + if (has_swap) { + printf("%6" PRIu64 "K ", total_swap / 1024); + printf("%6" PRIu64 "K ", total_pswap / 1024); + printf("%6" PRIu64 "K ", total_uswap / 1024); + if (has_zram) { + printf("%6" PRIu64 "K ", total_zswap / 1024); + } + } + + printf("TOTAL for oomadj < %d (%6" PRIu64 "K)\n", *lmk_adj_it, *lmk_minfree_it / 1024); + } + }; + + for (auto& proc: procs) { + if (oomadj) { + print_oomadj_totals(proc.oomadj); + } + + std::string cmdline = getprocname(proc.pid); + + total_pss += proc.usage.pss; + total_uss += proc.usage.uss; + total_swap += proc.usage.swap; + + printf("%5d ", proc.pid); + + if (oomadj) { + printf("%5d ", proc.oomadj); + } + + if (ws) { + printf("%6zuK %6zuK %6zuK ", + proc.usage.rss / 1024, + proc.usage.pss / 1024, + proc.usage.uss / 1024 + ); + } else { + printf("%7zuK %6zuK %6zuK %6zuK ", + proc.usage.vss / 1024, + proc.usage.rss / 1024, + proc.usage.pss / 1024, + proc.usage.uss / 1024 + ); + } + + if (has_swap) { + pm_swapusage_t su; + + pm_memusage_pswap_get_usage(&proc.usage, &su); + printf("%6zuK ", proc.usage.swap / 1024); + printf("%6zuK ", su.proportional / 1024); + printf("%6zuK ", su.unique / 1024); + total_pswap += su.proportional; + total_uswap += su.unique; + pm_memusage_pswap_free(&proc.usage); + if (has_zram) { + size_t zpswap = su.proportional * zram_cr; + printf("%6zuK ", zpswap / 1024); + total_zswap += zpswap; + } + } + + printf("%s\n", cmdline.c_str()); + } + + pm_memusage_pswap_destroy(p_swap); + + if (oomadj) { + print_oomadj_totals(INT_MAX); + } + + // Print the separator line + printf("%5s ", ""); + + if (oomadj) { + printf("%5s ", ""); + } + + if (ws) { + printf("%7s %7s %7s ", "", "------", "------"); + } else { + printf("%8s %7s %7s %7s ", "", "", "------", "------"); + } + + if (has_swap) { + printf("%7s %7s %7s ", "------", "------", "------"); + if (has_zram) { + printf("%7s ", "------"); + } + } + + printf("%s\n", "------"); + + // Print the total line + printf("%5s ", ""); + + if (oomadj) { + printf("%5s ", ""); + } + + if (ws) { + printf("%7s %6" PRIu64 "K %6" PRIu64 "K ", + "", total_pss / 1024, total_uss / 1024); + } else { + printf("%8s %7s %6" PRIu64 "K %6" PRIu64 "K ", + "", "", total_pss / 1024, total_uss / 1024); + } + + if (has_swap) { + printf("%6" PRIu64 "K ", total_swap / 1024); + printf("%6" PRIu64 "K ", total_pswap / 1024); + printf("%6" PRIu64 "K ", total_uswap / 1024); + if (has_zram) { + printf("%6" PRIu64 "K ", total_zswap / 1024); + } + } + + printf("TOTAL\n"); + + printf("\n"); + + if (has_swap) { + printf("ZRAM: %" PRIu64 "K physical used for %" PRIu64 "K in swap " + "(%" PRIu64 "K total swap)\n", + mem[MEMINFO_ZRAM_TOTAL], (mem[MEMINFO_SWAP_TOTAL] - mem[MEMINFO_SWAP_FREE]), + mem[MEMINFO_SWAP_TOTAL]); + } + printf(" RAM: %" PRIu64 "K total, %" PRIu64 "K free, %" PRIu64 "K buffers, " + "%" PRIu64 "K cached, %" PRIu64 "K shmem, %" PRIu64 "K slab\n", + mem[MEMINFO_TOTAL], mem[MEMINFO_FREE], mem[MEMINFO_BUFFERS], + mem[MEMINFO_CACHED], mem[MEMINFO_SHMEM], mem[MEMINFO_SLAB]); + + return 0; +} + +static void usage(char *myname) { + fprintf(stderr, "Usage: %s [ -W ] [ -v | -r | -p | -u | -s | -h ]\n" + " -v Sort by VSS.\n" + " -r Sort by RSS.\n" + " -p Sort by PSS.\n" + " -u Sort by USS.\n" + " -s Sort by swap.\n" + " (Default sort order is PSS.)\n" + " -R Reverse sort order (default is descending).\n" + " -c Only show cached (storage backed) pages\n" + " -C Only show non-cached (ram/swap backed) pages\n" + " -k Only show pages collapsed by KSM\n" + " -w Display statistics for working set only.\n" + " -W Reset working set of all processes.\n" + " -o Show and sort by oom score against lowmemorykiller thresholds.\n" + " -h Display this help screen.\n", + myname); +} + +// Get the process name for a given PID. +static std::string getprocname(pid_t pid) { + std::string filename = android::base::StringPrintf("/proc/%d/cmdline", pid); + + std::string procname; + + if (!android::base::ReadFileToString(filename, &procname)) { + // The process went away before we could read its process name. + procname = "<unknown>"; + } + + return procname; +} + +static int getoomadj(pid_t pid) { + std::string filename = android::base::StringPrintf("/proc/%d/oom_score_adj", pid); + std::string oomadj; + + if (!android::base::ReadFileToString(filename, &oomadj)) { + return -1001; + } + + return strtol(oomadj.c_str(), NULL, 10); +} + +static bool getminfree(std::vector<uint64_t>* minfree, std::vector<int>* adj) { + std::string minfree_str; + std::string adj_str; + + if (!android::base::ReadFileToString("/sys/module/lowmemorykiller/parameters/minfree", &minfree_str)) { + return false; + } + + if (!android::base::ReadFileToString("/sys/module/lowmemorykiller/parameters/adj", &adj_str)) { + return false; + } + + std::vector<std::string> minfree_vec = android::base::Split(minfree_str, ","); + std::vector<std::string> adj_vec = android::base::Split(adj_str, ","); + + minfree->clear(); + minfree->resize(minfree_vec.size()); + adj->clear(); + adj->resize(adj_vec.size()); + + std::transform(minfree_vec.begin(), minfree_vec.end(), minfree->begin(), + [](const std::string& s) -> uint64_t { + return strtoull(s.c_str(), NULL, 10) * PAGE_SIZE; + }); + + std::transform(adj_vec.begin(), adj_vec.end(), adj->begin(), + [](const std::string& s) -> int { + return strtol(s.c_str(), NULL, 10); + }); + + return true; +} + +static int numcmp(uint64_t a, uint64_t b) { + if (a < b) return -1; + if (a > b) return 1; + return 0; +} + +static int snumcmp(int64_t a, int64_t b) { + if (a < b) return -1; + if (a > b) return 1; + return 0; +} + +#define create_sort(field, compfn) \ + static int sort_by_ ## field (const void *a, const void *b) { \ + return order * compfn( \ + ((struct proc_info*)(a))->usage.field, \ + ((struct proc_info*)(b))->usage.field \ + ); \ + } + +create_sort(vss, numcmp) +create_sort(rss, numcmp) +create_sort(pss, numcmp) +create_sort(uss, numcmp) +create_sort(swap, numcmp) + +static int sort_by_oomadj (const void *a, const void *b) { + // Negative oomadj is higher priority, reverse the sort order + return -1 * order * snumcmp( + ((struct proc_info*)a)->oomadj, + ((struct proc_info*)b)->oomadj + ); +}