pagemon-0.01.10/0000755000175000017500000000000013006440061011733 5ustar kingkingpagemon-0.01.10/perf.c0000644000175000017500000000741413006440056013045 0ustar kingking/* * Copyright (C) Colin Ian King * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * as published by the Free Software Foundation; either version 2 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. * */ #define _GNU_SOURCE #include "perf.h" #if defined(PERF_ENABLED) #include #include #include #include #include #include #include #include #include #include #include #define UNRESOLVED (~0UL) static perf_tp_info_t perf_tp_info[] = { { PERF_TP_PAGE_FAULT_USER, "exceptions/page_fault_user" }, { PERF_TP_PAGE_FAULT_KERNEL, "exceptions/page_fault_kernel" }, { PERF_TP_MM_PAGE_ALLOC, "kmem/mm_page_alloc" }, { PERF_TP_MM_PAGE_FREE, "kmem/mm_page_free" }, }; static inline unsigned long perf_type_tracepoint_resolve_config(const char *path) { char perf_path[PATH_MAX]; unsigned long config; FILE *fp; snprintf(perf_path, sizeof(perf_path), "/sys/kernel/debug/tracing/events/%s/id", path); if ((fp = fopen(perf_path, "r")) == NULL) return UNRESOLVED; if (fscanf(fp, "%lu", &config) != 1) { fclose(fp); return UNRESOLVED; } fclose(fp); return config; } int perf_start(perf_t *p, const pid_t pid) { int i; if (pid <= 0) return 0; p->perf_opened = 0; for (i = 0; i < PERF_MAX; i++) { struct perf_event_attr attr; memset(&attr, 0, sizeof(attr)); attr.type = PERF_TYPE_TRACEPOINT; attr.config = perf_type_tracepoint_resolve_config(perf_tp_info[i].path); attr.disabled = 1; attr.inherit = 1; attr.read_format = PERF_FORMAT_TOTAL_TIME_ENABLED | PERF_FORMAT_TOTAL_TIME_RUNNING; attr.size = sizeof(attr); p->perf_stat[i].fd = syscall(__NR_perf_event_open, &attr, pid, -1, -1, 0); if (p->perf_stat[i].fd > -1) p->perf_opened++; else return -1; } if (!p->perf_opened) return -1; for (i = 0; i < PERF_MAX; i++) { int fd = p->perf_stat[i].fd; if (fd > -1) { if (ioctl(fd, PERF_EVENT_IOC_RESET, PERF_IOC_FLAG_GROUP) < 0) { (void)close(fd); p->perf_stat[i].fd = -1; continue; } if (ioctl(fd, PERF_EVENT_IOC_ENABLE, PERF_IOC_FLAG_GROUP) < 0) { (void)close(fd); p->perf_stat[i].fd = -1; } } } return 0; } /* * perf_stop() * stop and read counters */ int perf_stop(perf_t *p) { size_t i = 0; if (!p) return -1; if (!p->perf_opened) return -1; for (i = 0; i < PERF_MAX; i++) { const int fd = p->perf_stat[i].fd; /* assume invalid unless we get good data */ p->perf_stat[i].valid = false; if (fd < 0) continue; if (ioctl(fd, PERF_EVENT_IOC_DISABLE, PERF_IOC_FLAG_GROUP) == 0) { perf_data_t data; if (read(fd, &data, sizeof(data)) == sizeof(data)) { const double scale = data.time_running ? data.time_enabled / data.time_running : ((data.time_enabled == 0) ? 1.0 : 0.0); p->perf_stat[i].valid = true; p->perf_stat[i].counter += (uint64_t) ((double)data.counter * scale); } } (void)close(fd); p->perf_stat[i].fd = -1; } return 0; } /* * perf_counter * fetch counter and index via perf index */ uint64_t perf_counter( const perf_t *p, const int i) { if ((i < 0) || (i >= PERF_MAX)) return 0ULL; if (p->perf_stat[i].valid) return p->perf_stat[i].counter; return 0ULL; } #endif pagemon-0.01.10/pagemon.80000644000175000017500000000671613006440056013470 0ustar kingking.\" Hey, EMACS: -*- nroff -*- .\" First parameter, NAME, should be all caps .\" Second parameter, SECTION, should be 1-8, maybe w/ subsection .\" other parameters are allowed: see man(7), man(1) .TH PAGEMON 8 "January 31, 2016" .\" Please adjust this date whenever revising the manpage. .\" .\" Some roff macros, for reference: .\" .nh disable hyphenation .\" .hy enable hyphenation .\" .ad l left justify .\" .ad b justify to both left and right margins .\" .nf disable filling .\" .fi enable filling .\" .br insert line break .\" .sp insert n+1 empty lines .\" for manpage-specific macros, see man(7) .nr SS ((\n[.l] - \n[.i]) / 1n - 24) .SH NAME pagemon \- a tool to monitor memory pages. .br .SH SYNOPSIS .B pagemon .RI [options] .br .SH DESCRIPTION pagemon is a program that allows one to interactively monitor the memory pages of a process. .SH OPTIONS pagemon options are as follow: .TP .B \-a enable automatic zoom mode, this will change the zoom level to show the entire page map in the window, up to a maximum zoom level of 999. .TP .B \-d delay delay in microseconds between data refreshes, the default is 10,000 microseconds (1/100th of a second). .TP .B \-h show help. .TP .B \-p specify the process id (PID) or name of the process to monitor. If a name is given, then pagemon will monitor the first process that matches the name. .TP .B \-r read pages into memory. This will force all pages in the process to be read into physical memory. .TP .B \-t ticks specify ticks between dirty page checks. The default is 60 ticks; the larger the value the longer time between dirty page checks. .TP .B \-v enable VM information view. This is equivalent to pressing the 'v' or 'V' key when running pagemon. .TP .B \-z zoom specify the default zoom level on page view, the default is 1 (that is 1\-to\-1 view of pages). Higher values increase the zoom level so more pages are represented in the map view. .SH KEYS .TS expand; lB lBw(\n[SS]n) l l. Key Explanation Home Move cursor to start of page map or start of page End Move cursor to end of page map or end of page Cursor Up Move cursor up Cursor Down Move cursor down Cursor Left Move cursor left Cursor Right Move cursor right Page Up Move cursor 1/2 page up Page Down Move cursor 1/2 page down Esc, q, Q Quit Enter Toggle page map / memory map view Tab Toggle detailed view of page a, A Toggle automatic zoom mode v, V Toggle Virtual Memory statistics of process p, P Toggle page statistics ?, h Toggle help c, C Close all the pop up windows r, R Force all pages in process to be read into memory t Increase ticks between Dirty Page updates T Decrease ticks between Dirty Page updates +, z Zoom in (only in page map view) -, Z Zoom out (only in page map view) [ Zoom scale to 1, turn off automatic zoom mode ] Zoom scale to 999, turn off automatic zoom mode .TE .SH EXAMPLES .LP Monitor the thunderbird process: .RS 8 sudo pagemon -p thunderbird .RE .LP Monitor process 1 (init), zoom scale of 4: .RS 8 sudo pagemon -p 1 -z 4 .RE .SH AUTHOR pagemon was written by Colin King with contributions from Dr. David Alan Gilbert. .PP This manual page was written by Colin King , for the Ubuntu project (but may be used by others). .SH COPYRIGHT Copyright \(co 2016 Canonical Ltd. .br This is free software; see the source for copying conditions. There is NO warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. pagemon-0.01.10/Makefile0000644000175000017500000000360113006440056013377 0ustar kingking# # Copyright (C) 2015-2016 Colin Ian King # # This program is free software; you can redistribute it and/or # modify it under the terms of the GNU General Public License # as published by the Free Software Foundation; either version 2 # of the License, or (at your option) any later version. # # This program is distributed in the hope that it will be useful, # but WITHOUT ANY WARRANTY; without even the implied warranty of # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the # GNU General Public License for more details. # # You should have received a copy of the GNU General Public License # along with this program; if not, write to the Free Software # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. # # Author: Colin Ian King # VERSION=0.01.10 CFLAGS += -Wall -Wextra -DVERSION='"$(VERSION)"' -O2 LDFLAGS += -lncurses # Pedantic flags # ifeq ($(PEDANTIC),1) CFLAGS += -Wabi -Wcast-qual -Wfloat-equal -Wmissing-declarations \ -Wmissing-format-attribute -Wno-long-long -Wpacked \ -Wredundant-decls -Wshadow -Wno-missing-field-initializers \ -Wno-missing-braces -Wno-sign-compare -Wno-multichar endif BINDIR=/usr/sbin MANDIR=/usr/share/man/man8 SRC = pagemon.c perf.c OBJS = $(SRC:.c=.o) pagemon: $(OBJS) Makefile $(CC) $(CPPFLAGS) $(CFLAGS) $(OBJS) -o $@ $(LDFLAGS) pagemon.o: pagemon.c perf.h Makefile perf.o: perf.c perf.h Makefile pagemon.8.gz: pagemon.8 gzip -c $< > $@ dist: rm -rf pagemon-$(VERSION) mkdir pagemon-$(VERSION) cp -rp README Makefile pagemon.c pagemon.8 perf.c perf.h COPYING pagemon-$(VERSION) tar -zcf pagemon-$(VERSION).tar.gz pagemon-$(VERSION) rm -rf pagemon-$(VERSION) clean: rm -f pagemon pagemon.o pagemon.8.gz pagemon-$(VERSION).tar.gz install: pagemon pagemon.8.gz mkdir -p ${DESTDIR}${BINDIR} cp pagemon ${DESTDIR}${BINDIR} mkdir -p ${DESTDIR}${MANDIR} cp pagemon.8.gz ${DESTDIR}${MANDIR} pagemon-0.01.10/perf.h0000644000175000017500000000427213006440056013051 0ustar kingking/* * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * as published by the Free Software Foundation; either version 2 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. * */ #ifndef __PERF_H__ #define __PERF_H__ #define _GNU_SOURCE #include #include #include #include #include #if defined(__linux__) && defined(__NR_perf_event_open) #define PERF_ENABLED #endif enum { PERF_TP_PAGE_FAULT_USER = 0, PERF_TP_PAGE_FAULT_KERNEL, PERF_TP_MM_PAGE_ALLOC, PERF_TP_MM_PAGE_FREE, PERF_MAX }; /* per perf counter info */ typedef struct { uint64_t counter; /* perf counter */ bool valid; /* is it valid */ int fd; /* perf per counter fd */ } perf_stat_t; typedef struct { perf_stat_t perf_stat[PERF_MAX];/* perf counters */ int perf_opened; /* count of opened counters */ } perf_t; /* used for table of perf events to gather */ typedef struct { int id; /* stress-ng perf ID */ unsigned long type; /* perf types */ unsigned long config; /* perf type specific config */ } perf_info_t; /* perf trace point id -> path resolution */ typedef struct { int id; /* stress-ng perf ID */ char *path; /* path to config value */ } perf_tp_info_t; /* perf data */ typedef struct { uint64_t counter; /* perf counter */ uint64_t time_enabled; /* perf time enabled */ uint64_t time_running; /* perf time running */ } perf_data_t; static inline void perf_init(perf_t *p) { memset(p, 0, sizeof(perf_t)); } extern int perf_start(perf_t *p, const pid_t pid); extern int perf_stop(perf_t *p); extern uint64_t perf_counter(const perf_t *p, const int id); #endif pagemon-0.01.10/COPYING0000644000175000017500000004325413006440056013002 0ustar kingking GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Lesser General Public License instead.) You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) year name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice This General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. pagemon-0.01.10/README0000644000175000017500000000045013006440056012616 0ustar kingkingpagemon pagemon is an interactive memory/page monitoring tool allowing one to browse the memory map of an active running process on Linux. To be able access a process memory this tool needs to be run as root. Requirements: ncurses development library Copyright (C) Colin Ian King, 2015,2016 pagemon-0.01.10/pagemon.c0000644000175000017500000012055313006440056013537 0ustar kingking/* * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * as published by the Free Software Foundation; either version 2 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. * * Copyright (C) Colin Ian King 2015-2016 * colin.i.king@gmail.com */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "perf.h" #define APP_NAME "pagemon" #define MAX_MAPS (65536) #define ADDR_OFFSET (17) /* Display x offset from address */ #define HEX_WIDTH (3) /* Width of each 2 hex digit value */ #define VIEW_PAGE (0) /* View pages in memory map */ #define VIEW_MEM (1) /* View memory in hex */ #define MIN_TICKS (1) #define MAX_TICKS (1000) #define MIN_ZOOM (1) #define MAX_ZOOM (999) #define MAXIMUM(a, b) ((a) > (b) ? (a) : (b)) #define MINIMUM(a, b) ((a) < (b) ? (a) : (b)) #define DEFAULT_UDELAY (15000) /* Delay between each refresh */ #define DEFAULT_TICKS (60) /* Ticks between dirty page checks */ #define PROCPATH_MAX (32) /* Size of proc pathnames */ #define BLINK_MASK (0x20) /* Cursor blink counter mask */ /* * Memory size scaling */ #define KB (1024ULL) #define MB (KB * KB) #define GB (KB * KB * KB) #define TB (KB * KB * KB * KB) /* * Error returns */ #define OK (0) #define ERR_NO_MAP_INFO (-1) #define ERR_NO_MEM_INFO (-2) #define ERR_SMALL_WIN (-3) #define ERR_ALLOC_NOMEM (-4) #define ERR_TOO_MANY_PAGES (-5) #define ERR_TOO_FEW_PAGES (-6) #define ERR_RESIZE_FAIL (-7) #define ERR_NO_PROCESS (-8) #define ERR_FAULT (-9) /* * PTE bits from uint64_t in /proc/PID/pagemap * for each mapped page */ #define PAGE_PTE_SOFT_DIRTY (1ULL << 55) #define PAGE_EXCLUSIVE_MAPPED (1ULL << 56) #define PAGE_FILE_SHARED_ANON (1ULL << 61) #define PAGE_SWAPPED (1ULL << 62) #define PAGE_PRESENT (1ULL << 63) #define OPT_FLAG_READ_ALL_PAGES (0x00000001) #define OPT_FLAG_PID (0x00000002) enum { WHITE_RED = 1, WHITE_BLUE, WHITE_YELLOW, WHITE_CYAN, WHITE_GREEN, WHITE_BLACK, RED_BLUE, BLACK_WHITE, BLACK_BLACK, BLUE_WHITE, }; /* * Note that we use 64 bit addresses even for 32 bit systems since * this allows pagemon to run in a 32 bit chroot and still access * the 64 bit mapping info. Otherwise I'd use uintptr_t instead. */ typedef uint64_t addr_t; /* Addresses */ typedef int64_t index_t; /* Index into page tables */ typedef uint64_t pagemap_t; /* PTE page map bits */ typedef uint64_t checksum_t; /* Pagemap checksum */ /* * Memory map info, represents 1 or more pages */ typedef struct { addr_t begin; /* Start of mapping */ addr_t end; /* End of mapping */ char attr[5]; /* Map attributes */ char dev[6]; /* Map device, if any */ char name[NAME_MAX + 1]; /* Name of mapping */ } map_t; /* * Page info, 1 per page with map reference * to the memory map it belongs to */ typedef struct { addr_t addr; /* Address */ map_t *map; /* Mapping it is in */ index_t index; /* Index into map */ } page_t; /* * General memory mapping info, containing * a fix set of memory maps, and pointer * to an array of per page info. */ typedef struct { map_t maps[MAX_MAPS]; /* Mappings */ uint32_t nmaps; /* Number of mappings */ page_t *pages; /* Pages */ addr_t npages; /* Number of pages */ addr_t last_addr; /* Last address */ } mem_info_t; /* * Cursor context, we have one each for the * memory map and page contents views */ typedef struct { int32_t xpos; /* Cursor x position */ int32_t ypos; /* Cursor y position */ int32_t xpos_prev; /* Previous x position */ int32_t ypos_prev; /* Previous y position */ int32_t ypos_max; /* Max y position */ int32_t xmax; /* Width */ int32_t ymax; /* Height */ } position_t; /* * Globals, stashed in a global struct */ typedef struct { WINDOW *mainwin; /* curses main window */ sigjmp_buf env; /* terminate abort jmp */ addr_t max_pages; /* Max pages in system */ checksum_t checksum; /* Pagemap check sum */ checksum_t prev_checksum; /* Previous checksum */ uint32_t page_size; /* Page size in bytes */ pid_t pid; /* Process ID */ mem_info_t mem_info; /* Mapping and page info */ #if defined(PERF_ENABLED) perf_t perf; /* Perf context */ #endif bool curses_started; /* Are we in curses mode? */ bool tab_view; /* Page pop-up info */ bool vm_view; /* Process VM stats */ bool help_view; /* Help pop-up info */ bool resized; /* SIGWINCH occurred */ bool terminate; /* SIGSEGV termination */ bool auto_zoom; /* Automatic zoom */ #if defined(PERF_ENABLED) bool perf_view; /* Perf statistics */ #endif uint8_t view; /* Default page or memory view */ uint8_t opt_flags; /* User option flags */ char path_refs[PROCPATH_MAX]; /* /proc/$PID/clear_refs */ char path_pagemap[PROCPATH_MAX];/* /proc/$PID/pagemap */ char path_maps[PROCPATH_MAX]; /* /proc/$PID/maps */ char path_mem[PROCPATH_MAX]; /* /proc/$PID/mem */ char path_status[PROCPATH_MAX]; /* /proc/$PID/status */ char path_stat[PROCPATH_MAX]; /* /proc/$PID/stat */ char path_oom[PROCPATH_MAX]; /* /proc/$PID/oom_score */ } global_t; static global_t g; /* * mem_to_str() * report memory in different units */ static void mem_to_str(const addr_t addr, char *buf, const size_t buflen) { uint64_t scaled, val = (uint64_t)addr; char unit; if (val < 99 * MB) { scaled = val / KB; unit = 'K'; } else if (val < 99 * GB) { scaled = val / MB; unit = 'M'; } else if (val < 99 * TB) { scaled = val / GB; unit = 'G'; } else { scaled = val / TB; unit = 'T'; } snprintf(buf, buflen, "%7" PRIu64 " %c", scaled, unit); } /* * read_buf() * read data into a buffer, just * for one liner /proc file reading */ static int read_buf( const char *path, char *buffer, const size_t sz) { int fd; ssize_t ret; if ((fd = open(path, O_RDONLY)) < 0) return -1; ret = read(fd, buffer, sz); (void)close(fd); if ((ret < 1) || (ret > (ssize_t)sz)) return -1; buffer[ret - 1] = '\0'; return 0; } /* * proc_name_to_pid() * find a process by name, return PID of * first match found. Zero indicates error */ static pid_t proc_name_to_pid(char *const name) { char *ptr; bool isnum = true; DIR *dir; struct dirent *d; pid_t pid = 0; /* Could be just a pid in numeric form */ for (ptr = name; *ptr; ptr++) { if (!isdigit(*ptr)) { isnum = false; break; } } if (isnum) { pid = (pid_t)strtol(name, NULL, 10); if (errno || (pid < 1)) { fprintf(stderr, "Invalid pid value '%s'\n", name); return 0; } return pid; } /* No, search for process name */ dir = opendir("/proc"); if (!dir) return pid; while ((d = readdir(dir)) != NULL) { char path[PATH_MAX], buf[4096], *bn; if (!isdigit(d->d_name[0])) continue; snprintf(path, sizeof(path), "/proc/%s/cmdline", d->d_name); if (read_buf(path, buf, sizeof(buf)) < 0) continue; bn = basename(buf); if (!bn) continue; if (!strcmp(name, bn)) { pid = (pid_t)strtol(d->d_name, NULL, 10); if ((errno == 0) && (pid > 0)) break; } } (void)closedir(dir); if (!pid) fprintf(stderr, "Cannot find process '%s'\n", name); return pid; } /* * read_faults() * read minor and major page faults */ static int read_faults( uint64_t *minor_flt, uint64_t *major_flt) { int count = 0; char buf[4096], *ptr = buf; *minor_flt = 0; *major_flt = 0; if (read_buf(g.path_stat, buf, sizeof(buf)) < 0) return -1; /* * Skipping over fields is less expensive * than lots of sscanf fields being parsed */ while (*ptr) { if (*ptr == ' ') { count++; if (count == 9) break; } ptr++; } if (!*ptr) return -1; if (sscanf(ptr, "%" SCNu64 " %*u %" SCNu64, minor_flt, major_flt) != 2) return -1; return 0; } /* * read_oom_score() * read the process oom score */ static int read_oom_score(uint64_t *score) { char buf[4096]; *score = ~0ULL; if (read_buf(g.path_oom, buf, sizeof(buf)) < 0) return -1; if (sscanf(buf, "%" SCNu64, score) != 1) return -1; return 0; } /* * read_maps() * read memory maps for a specifc process */ static int read_maps(const bool force) { FILE *fp; uint32_t i, j, n = 0; char buffer[4096]; page_t *page; checksum_t checksum = 0ULL; map_t *map; g.mem_info.npages = 0; g.mem_info.last_addr = 0; if (kill(g.pid, 0) < 0) return ERR_NO_PROCESS; if (force) g.prev_checksum = 0; fp = fopen(g.path_maps, "r"); if (fp == NULL) return ERR_NO_MAP_INFO; map = g.mem_info.maps; while (fgets(buffer, sizeof(buffer), fp) != NULL) { int ret; intptr_t length; map->name[0] = '\0'; ret = sscanf(buffer, "%" SCNx64 "-%" SCNx64 " %5s %*s %6s %*d %s", &map->begin, &map->end, map->attr, map->dev, map->name); if ((ret != 5) && (ret != 4)) continue; if (ret == 4) map->name[0]= '\0'; /* Simple sanity check */ if (map->end < map->begin) continue; length = map->end - map->begin; /* Check for overflow */ if (g.mem_info.npages + length < g.mem_info.npages) continue; if (g.mem_info.last_addr < map->end) g.mem_info.last_addr = map->end; checksum ^= map->begin; checksum <<= 1; checksum ^= map->end; checksum <<= 1; checksum ^= map->attr[0]; checksum <<= 1; checksum ^= map->attr[1]; checksum <<= 1; checksum ^= map->attr[2]; checksum <<= 1; checksum ^= map->attr[3]; checksum <<= 1; checksum ^= length; g.mem_info.npages += length / g.page_size; n++; map++; if (n >= MAX_MAPS) break; } fclose(fp); checksum += g.mem_info.npages; checksum += n; g.checksum = checksum; /* No change in maps, so nothing to do */ if (g.checksum == g.prev_checksum) return OK; g.prev_checksum = checksum; /* Unlikely, but need to keep Coverity Scan happy */ if (g.mem_info.npages > g.max_pages) return ERR_TOO_MANY_PAGES; if (g.mem_info.npages == 0) return ERR_TOO_FEW_PAGES; free(g.mem_info.pages); g.mem_info.nmaps = n; g.mem_info.pages = calloc(g.mem_info.npages, sizeof(page_t)); if (!g.mem_info.pages) { g.mem_info.nmaps = 0; return ERR_ALLOC_NOMEM; } map = g.mem_info.maps; page = g.mem_info.pages; for (i = 0; i < g.mem_info.nmaps; i++, map++) { addr_t addr = map->begin; addr_t count = (map->end - map->begin) / g.page_size; for (j = 0; j < count; j++, page++) { page->addr = addr; page->map = map; page->index = i; addr += g.page_size; } } return (n == 0) ? ERR_NO_MAP_INFO : OK; } /* * handle_winch() * handle SIGWINCH, flag a window resize */ static void handle_winch(int sig) { (void)sig; g.resized = true; } /* * handle_terminate() * handle termination signals */ static void handle_terminate(int sig) { static bool already_handled = false; (void)sig; if (already_handled) { exit(EXIT_FAILURE); } g.terminate = true; siglongjmp(g.env, 1); } /* * show_usage() * mini help info */ static void show_usage(void) { printf(APP_NAME ", version " VERSION "\n\n" "Usage: " APP_NAME " [options]\n" " -a enable automatic zoom mode\n" " -d delay in microseconds between refreshes, " "default %u\n" " -h help\n" " -p pid process ID to monitor\n" " -r read (page back in) pages at start\n" " -t ticks ticks between dirty page checks\n" " -v enable VM view\n" " -z zoom set page zoom scale\n", DEFAULT_UDELAY); } #if defined(PERF_ENABLED) /* * show_perf() * show perf stats */ static void show_perf(void) { int y = LINES - 6; const int x = 2; static uint8_t perf_ticker = 0; /* Don't hammer perf to death */ if (++perf_ticker > 10) { perf_stop(&g.perf); perf_start(&g.perf, g.pid); perf_ticker = 0; } wattrset(g.mainwin, COLOR_PAIR(WHITE_CYAN) | A_BOLD); mvwprintw(g.mainwin, y + 0, x, " Page Faults (User Space): %15" PRIu64 " ", perf_counter(&g.perf, PERF_TP_PAGE_FAULT_USER)); mvwprintw(g.mainwin, y + 1, x, " Page Faults (Kernel Space): %15" PRIu64 " ", perf_counter(&g.perf, PERF_TP_PAGE_FAULT_KERNEL)); mvwprintw(g.mainwin, y + 2, x, " Kernel Page Allocate: %15" PRIu64 " ", perf_counter(&g.perf, PERF_TP_MM_PAGE_ALLOC)); mvwprintw(g.mainwin, y + 3, x, " Kernel Page Free: %15" PRIu64 " ", perf_counter(&g.perf, PERF_TP_MM_PAGE_FREE)); } #endif /* * show_vm() * show Virtual Memory stats */ static void show_vm(void) { FILE *fp; char buffer[4096]; int y = 2; const int x = COLS - 26; uint64_t major, minor, score; fp = fopen(g.path_status, "r"); if (fp == NULL) return; wattrset(g.mainwin, COLOR_PAIR(WHITE_BLUE) | A_BOLD); while (fgets(buffer, sizeof(buffer), fp) != NULL) { char vmname[9], size[8]; char state[6], longstate[13]; uint64_t sz; if (sscanf(buffer, "State: %5s %12s", state, longstate) == 2) { mvwprintw(g.mainwin, y++, x, " State: %-12.12s ", longstate); continue; } if (sscanf(buffer, "Vm%8s %" SCNu64 "%7s", vmname, &sz, size) == 3) { mvwprintw(g.mainwin, y++, x, " Vm%-6.6s %10" PRIu64 " %s ", vmname, sz, size); continue; } } fclose(fp); if (!read_faults(&minor, &major)) { mvwprintw(g.mainwin, y++, x, " %-23s", "Page Faults:"); mvwprintw(g.mainwin, y++, x, " Minor: %12" PRIu64 " ", minor); mvwprintw(g.mainwin, y++, x, " Major: %12" PRIu64 " ", major); } if (!read_oom_score(&score)) { mvwprintw(g.mainwin, y++, x, " OOM Score: %8" PRIu64 " ", score); } } /* * show_page_bits() * show info based on the page bit pattern */ static void show_page_bits( const int fd, map_t *map, const index_t index) { pagemap_t pagemap_info; off_t offset; char buf[16]; const int x = 2; mem_to_str(map->end - map->begin, buf, sizeof(buf) - 1); wattrset(g.mainwin, COLOR_PAIR(WHITE_BLUE) | A_BOLD); mvwprintw(g.mainwin, 2, x, " Page: 0x%16.16" PRIx64 "%18s", g.mem_info.pages[index].addr, ""); mvwprintw(g.mainwin, 3, x, " Page Size: 0x%8.8" PRIx32 " bytes%20s", g.page_size, ""); mvwprintw(g.mainwin, 4, x, " Map: 0x%16.16" PRIx64 "-%16.16" PRIx64 " ", map->begin, map->end - 1); mvwprintw(g.mainwin, 5, x, " Map Size: %s%27s", buf, ""); mvwprintw(g.mainwin, 6, x, " Device: %5.5s%31s", map->dev, ""); mvwprintw(g.mainwin, 7, x, " Prot: %4.4s%32s", map->attr, ""); mvwprintw(g.mainwin, 8, x, " Map Name: %-35.35s ", map->name[0] == '\0' ? "[Anonymous]" : basename(map->name)); offset = sizeof(pagemap_t) * (g.mem_info.pages[index].addr / g.page_size); if (lseek(fd, offset, SEEK_SET) == (off_t)-1) return; if (read(fd, &pagemap_info, sizeof(pagemap_info)) != sizeof(pagemap_info)) return; mvwprintw(g.mainwin, 9, x, " Flag: 0x%16.16" PRIx64 "%18s", pagemap_info, ""); if (pagemap_info & PAGE_SWAPPED) { mvwprintw(g.mainwin, 10, x, " Swap Type: 0x%2.2" PRIx64 "%20s", pagemap_info & 0x1f, ""); mvwprintw(g.mainwin, 11, x, " Swap Offset: 0x%16.16" PRIx64 "%6s", (pagemap_info & 0x00ffffffffffffffULL) >> 5, ""); } else { mvwprintw(g.mainwin, 10, x, "%48s", ""); mvwprintw(g.mainwin, 11, x, " Page Frame Number: 0x%16.16" PRIx64 "%6s", pagemap_info & 0x00ffffffffffffffULL, ""); } mvwprintw(g.mainwin, 12, x, " Soft-dirty PTE: %3s%21s", (pagemap_info & PAGE_PTE_SOFT_DIRTY) ? "Yes" : "No ", ""); mvwprintw(g.mainwin, 13, x, " Exclusively Mapped: %3s%21s", (pagemap_info & PAGE_EXCLUSIVE_MAPPED) ? "Yes" : "No ", ""); mvwprintw(g.mainwin, 14, x, " File or Shared Anon: %3s%21s", (pagemap_info & PAGE_FILE_SHARED_ANON) ? "Yes" : "No ", ""); mvwprintw(g.mainwin, 15, x, " Present in Swap: %3s%21s", (pagemap_info & PAGE_SWAPPED) ? "Yes" : "No ", ""); mvwprintw(g.mainwin, 16, x, " Present in RAM: %3s%21s", (pagemap_info & PAGE_PRESENT) ? "Yes" : "No ", ""); } /* * banner() * clear a banner across the window */ static inline void banner(const int y) { mvwprintw(g.mainwin, y, 0, "%*s", COLS, ""); } /* * show_pages() * show page mapping */ static int show_pages( const index_t cursor_index, const index_t page_index, const position_t *p, const int32_t zoom) { int32_t i; index_t index; const uint32_t shift = ((uint32_t)(8 * sizeof(pagemap_t) - 4 - __builtin_clzll((g.page_size)))); int fd; map_t *map; const int32_t xmax = p->xmax, ymax = p->ymax; pagemap_t pagemap_info_buf[xmax]; if ((fd = open(g.path_pagemap, O_RDONLY)) < 0) return ERR_NO_MAP_INFO; index = page_index; for (i = 1; i <= ymax; i++) { int32_t j; addr_t addr, offset; const size_t sz = sizeof(pagemap_info_buf); if (index >= (index_t)g.mem_info.npages) { wattrset(g.mainwin, COLOR_PAIR(BLACK_BLACK)); mvwprintw(g.mainwin, i, 0, "---------------- "); } else { addr = g.mem_info.pages[index].addr; wattrset(g.mainwin, COLOR_PAIR(BLACK_WHITE)); mvwprintw(g.mainwin, i, 0, "%16.16" PRIx64 " ", addr); } /* * Slurp up an entire row */ addr = g.mem_info.pages[index].addr; map = g.mem_info.pages[index].map; offset = (addr >> shift) & ~7; memset(pagemap_info_buf, 0, sz); if (lseek(fd, offset, SEEK_SET) != (off_t)-1) { ssize_t ret = read(fd, pagemap_info_buf, sz); (void)ret; } for (j = 0; j < xmax; j++) { char state = '.'; int attr = COLOR_PAIR(BLACK_WHITE); if (index >= (index_t)g.mem_info.npages) { attr = COLOR_PAIR(BLACK_BLACK); state = '~'; } else { map_t *new_map; register pagemap_t pagemap_info; new_map = g.mem_info.pages[index].map; /* * On a different mapping? If so, slurp up * the new mappings from here to end */ if (new_map != map) { map = new_map; addr = g.mem_info.pages[index].addr; offset = (addr >> shift) & ~7; if (lseek(fd, offset, SEEK_SET) == (off_t)-1) break; if (read(fd, &pagemap_info_buf[j], (xmax - j) * sizeof(pagemap_t)) < 0) break; } __builtin_prefetch(&g.mem_info.pages[index + zoom].addr, 1, 1); pagemap_info = pagemap_info_buf[j]; attr = COLOR_PAIR(BLACK_WHITE); if (pagemap_info & PAGE_PRESENT) { attr = COLOR_PAIR(WHITE_YELLOW); state = 'P'; } if (pagemap_info & PAGE_SWAPPED) { attr = COLOR_PAIR(WHITE_GREEN); state = 'S'; } if (pagemap_info & PAGE_FILE_SHARED_ANON) { attr = COLOR_PAIR(WHITE_RED); state = 'M'; } if (pagemap_info & PAGE_PTE_SOFT_DIRTY) { attr = COLOR_PAIR(WHITE_CYAN); state = 'D'; } index += zoom; } wattrset(g.mainwin, attr); mvwprintw(g.mainwin, i, ADDR_OFFSET + j, "%c", state); } } wattrset(g.mainwin, A_NORMAL); map = g.mem_info.pages[cursor_index].map; if (map && g.tab_view) show_page_bits(fd, map, cursor_index); if (g.vm_view) show_vm(); #if defined(PERF_ENABLED) if (g.perf_view) show_perf(); #endif (void)close(fd); return 0; } /* * show_memory() * show memory contents */ static int show_memory( const index_t page_index, index_t data_index, const position_t *p) { addr_t addr; index_t index = page_index; int32_t i; const int32_t xmax = p->xmax, ymax = p->ymax; int fd; if ((fd = open(g.path_mem, O_RDONLY)) < 0) return ERR_NO_MEM_INFO; for (i = 1; i <= ymax; i++) { int32_t j; uint8_t bytes[xmax]; ssize_t nread = 0; addr = g.mem_info.pages[index].addr + data_index; if (lseek(fd, (off_t)addr, SEEK_SET) == (off_t)-1) { nread = -1; } else { nread = read(fd, bytes, (size_t)xmax); if (nread < 0) nread = -1; } wattrset(g.mainwin, COLOR_PAIR(BLACK_WHITE)); if (index >= (index_t)g.mem_info.npages) mvwprintw(g.mainwin, i, 0, "---------------- "); else mvwprintw(g.mainwin, i, 0, "%16.16" PRIx64 " ", addr); mvwprintw(g.mainwin, i, COLS - 3, " "); for (j = 0; j < xmax; j++) { uint8_t byte; addr = g.mem_info.pages[index].addr + data_index; if ((index >= (index_t)g.mem_info.npages) || (addr > g.mem_info.last_addr)) { /* End of memory */ wattrset(g.mainwin, COLOR_PAIR(BLACK_BLACK)); mvwprintw(g.mainwin, i, ADDR_OFFSET + (HEX_WIDTH * j), " "); mvwprintw(g.mainwin, i, ADDR_OFFSET + (HEX_WIDTH * xmax) + j, " "); goto do_border; } if (j > nread) { /* Failed to read data */ wattrset(g.mainwin, COLOR_PAIR(WHITE_BLUE)); mvwprintw(g.mainwin, i, ADDR_OFFSET + (HEX_WIDTH * j), "?? "); wattrset(g.mainwin, COLOR_PAIR(BLACK_WHITE)); mvwprintw(g.mainwin, i, ADDR_OFFSET + (HEX_WIDTH * xmax) + j, "?"); goto do_border; } /* We have some legimate data to display */ byte = bytes[j]; wattrset(g.mainwin, COLOR_PAIR(WHITE_BLUE)); mvwprintw(g.mainwin, i, ADDR_OFFSET + (HEX_WIDTH * j), "%2.2" PRIx8 " ", byte); wattrset(g.mainwin, COLOR_PAIR(BLACK_WHITE)); byte &= 0x7f; mvwprintw(g.mainwin, i, ADDR_OFFSET + (HEX_WIDTH * xmax) + j, "%c", (byte < 32 || byte > 126) ? '.' : byte); do_border: wattrset(g.mainwin, COLOR_PAIR(BLACK_WHITE)); mvwprintw(g.mainwin, i, 16 + (HEX_WIDTH * xmax), " "); data_index++; if (data_index >= g.page_size) { data_index -= g.page_size; index++; } } } (void)close(fd); return 0; } /* * read_all_pages() * read in all pages into memory, this * will force swapped out pages back into * memory */ static int read_all_pages(void) { int fd; index_t index; if ((fd = open(g.path_mem, O_RDONLY)) < 0) return ERR_NO_MEM_INFO; for (index = 0; index < (index_t)g.mem_info.npages; index++) { const off_t addr = g.mem_info.pages[index].addr; uint8_t byte; if (lseek(fd, addr, SEEK_SET) == (off_t)-1) continue; if (read(fd, &byte, sizeof(byte)) < 0) continue; } (void)close(fd); return 0; } /* * show_key() * show key for mapping info */ static inline void show_key(void) { banner(LINES - 1); if (g.view == VIEW_PAGE) { wattrset(g.mainwin, COLOR_PAIR(WHITE_BLUE) | A_BOLD); mvwprintw(g.mainwin, LINES - 1, 0, "Page View, KEY: "); wattrset(g.mainwin, COLOR_PAIR(WHITE_RED)); wprintw(g.mainwin, "A"); wattrset(g.mainwin, COLOR_PAIR(WHITE_BLUE) | A_BOLD); wprintw(g.mainwin, " Anon/File, "); wattrset(g.mainwin, COLOR_PAIR(WHITE_YELLOW)); wprintw(g.mainwin, "P"); wattrset(g.mainwin, COLOR_PAIR(WHITE_BLUE) | A_BOLD); wprintw(g.mainwin, " Present in RAM, "); wattrset(g.mainwin, COLOR_PAIR(WHITE_CYAN)); wprintw(g.mainwin, "D"); wattrset(g.mainwin, COLOR_PAIR(WHITE_BLUE) | A_BOLD); wprintw(g.mainwin, " Dirty, "); wattrset(g.mainwin, COLOR_PAIR(WHITE_GREEN)); wprintw(g.mainwin, "S"); wattrset(g.mainwin, COLOR_PAIR(WHITE_BLUE) | A_BOLD); wprintw(g.mainwin, " Swap, "); wattrset(g.mainwin, COLOR_PAIR(BLACK_WHITE)); wprintw(g.mainwin, "."); wattrset(g.mainwin, COLOR_PAIR(WHITE_BLUE) | A_BOLD); wprintw(g.mainwin, " not in RAM"); wattrset(g.mainwin, COLOR_PAIR(BLACK_WHITE) | A_BOLD); } else { wattrset(g.mainwin, COLOR_PAIR(WHITE_BLUE) | A_BOLD); mvwprintw(g.mainwin, LINES - 1, 0, "%-*s", COLS, "Memory View"); } } /* * show_help() * show pop-up help info */ static inline void show_help(void) { const int x = (COLS - 45) / 2; int y = (LINES - 15) / 2; wattrset(g.mainwin, COLOR_PAIR(WHITE_RED) | A_BOLD); mvwprintw(g.mainwin, y++, x, " Pagemon Process Memory Monitor Quick Help "); mvwprintw(g.mainwin, y++, x, "%43s", ""); mvwprintw(g.mainwin, y++, x, " ? or h This help information%10s", ""); mvwprintw(g.mainwin, y++, x, " Esc or q Quit%27s", ""); mvwprintw(g.mainwin, y++, x, " Tab Toggle page information%8s", ""); mvwprintw(g.mainwin, y++, x, " Enter Toggle map/memory views%8s", ""); mvwprintw(g.mainwin, y++, x, " + or z Zoom in memory map%13s", ""); mvwprintw(g.mainwin, y++, x, " - or Z Zoom out memory map%12s", ""); mvwprintw(g.mainwin, y++, x, " R or r Read pages (swap in all pages) "); mvwprintw(g.mainwin, y++, x, " A or a Toggle Auto Zoom on/off "); mvwprintw(g.mainwin, y++, x, " V or v Toggle Virtual Memory Stats "); #if defined(PERF_ENABLED) mvwprintw(g.mainwin, y++, x, " P or p Toggle Perf Page Stats "); #endif mvwprintw(g.mainwin, y++, x, " PgUp/Down Scroll up/down 1/2 page%8s", ""); mvwprintw(g.mainwin, y++, x, " Home/End Move cursor back to top/bottom "); mvwprintw(g.mainwin, y, x, " [ / ] Zoom 1 / Zoom 999 "); mvwprintw(g.mainwin, y, x, " Cursor keys move Up/Down/Left/Right%7s", ""); } /* * update_xymax() * set the xymax scale for a specific view v * based on column width and scaling factor for * page or mem (hex) views */ static inline void update_xymax(position_t *position, int v) { static const int32_t xmax_scale[] = { 1, /* VIEW_PAGE */ 4 /* VIEW_MEM */ }; position[v].xmax = (COLS - ADDR_OFFSET) / xmax_scale[v]; position[v].ymax = LINES - 2; } /* * reset_cursor() * reset to home position */ static inline void reset_cursor( position_t *p, index_t *data_index, index_t *page_index) { p->xpos = 0; p->ypos = 0; *data_index = 0; *page_index = 0; } int main(int argc, char **argv) { struct sigaction action; map_t *map; useconds_t udelay; position_t position[2]; index_t page_index, prev_page_index; index_t data_index, prev_data_index; int32_t tick, ticks, blink, zoom; int rc, ret; if (sigsetjmp(g.env, 0)) { rc = ERR_FAULT; goto terminate; } g.pid = -1; rc = OK; blink = 0; zoom = MIN_ZOOM; ticks = DEFAULT_TICKS; tick = 0; udelay = DEFAULT_UDELAY; page_index = 0; data_index = 0; for (;;) { int c = getopt(argc, argv, "ad:hp:rt:vz:"); if (c == -1) break; switch (c) { case 'a': g.auto_zoom = true; break; case 'd': udelay = strtoul(optarg, NULL, 10); if (errno) { fprintf(stderr, "Invalid delay value\n"); exit(EXIT_FAILURE); } break; case 'h': show_usage(); exit(EXIT_SUCCESS); break; case 'p': g.pid = proc_name_to_pid(optarg); if (g.pid < 1) exit(EXIT_FAILURE); g.opt_flags |= OPT_FLAG_PID; break; case 'r': g.opt_flags |= OPT_FLAG_READ_ALL_PAGES; break; case 't': ticks = strtol(optarg, NULL, 10); if ((ticks < MIN_TICKS) || (ticks > MAX_TICKS)) { fprintf(stderr, "Invalid ticks value\n"); exit(EXIT_FAILURE); } break; case 'v': g.vm_view = true; break; case 'z': zoom = strtoul(optarg, NULL, 10); if (errno || (zoom < MIN_ZOOM) || (zoom > MAX_ZOOM)) { fprintf(stderr, "Invalid zoom value\n"); exit(EXIT_FAILURE); } break; default: show_usage(); exit(EXIT_FAILURE); } } if (!(g.opt_flags & OPT_FLAG_PID)) { fprintf(stderr, "Must provide process ID with -p option\n"); exit(EXIT_FAILURE); } if (geteuid() != 0) { fprintf(stderr, "%s requires root privileges to " "access memory of pid %d\n", APP_NAME, g.pid); exit(EXIT_FAILURE); } if (kill(g.pid, 0) < 0) { fprintf(stderr, "No such process %d\n", g.pid); exit(EXIT_FAILURE); } g.page_size = sysconf(_SC_PAGESIZE); if (g.page_size == (uint32_t)-1) { /* Guess */ g.page_size = 4096UL; } g.max_pages = ((addr_t)((size_t)~0)) / g.page_size; memset(&action, 0, sizeof(action)); action.sa_handler = handle_winch; if (sigaction(SIGWINCH, &action, NULL) < 0) { fprintf(stderr, "Could not set up window resizing handler\n"); exit(EXIT_FAILURE); } memset(&action, 0, sizeof(action)); action.sa_handler = handle_terminate; if (sigaction(SIGSEGV, &action, NULL) < 0) { fprintf(stderr, "Could not set up error handler\n"); exit(EXIT_FAILURE); } if (sigaction(SIGBUS, &action, NULL) < 0) { fprintf(stderr, "Could not set up error handler\n"); exit(EXIT_FAILURE); } snprintf(g.path_refs, sizeof(g.path_refs), "/proc/%i/clear_refs", g.pid); snprintf(g.path_pagemap, sizeof(g.path_pagemap), "/proc/%i/pagemap", g.pid); snprintf(g.path_maps, sizeof(g.path_maps), "/proc/%i/maps", g.pid); snprintf(g.path_mem, sizeof(g.path_mem), "/proc/%i/mem", g.pid); snprintf(g.path_status, sizeof(g.path_status), "/proc/%i/status", g.pid); snprintf(g.path_stat, sizeof(g.path_stat), "/proc/%i/stat", g.pid); snprintf(g.path_oom, sizeof(g.path_stat), "/proc/%i/oom_score", g.pid); initscr(); start_color(); cbreak(); noecho(); nodelay(stdscr, 1); keypad(stdscr, 1); curs_set(0); g.mainwin = newwin(LINES, COLS, 0, 0); g.curses_started = true; init_pair(WHITE_RED, COLOR_WHITE, COLOR_RED); init_pair(WHITE_BLUE, COLOR_WHITE, COLOR_BLUE); init_pair(WHITE_YELLOW, COLOR_WHITE, COLOR_YELLOW); init_pair(WHITE_CYAN, COLOR_WHITE, COLOR_CYAN); init_pair(WHITE_GREEN, COLOR_WHITE, COLOR_GREEN); init_pair(WHITE_BLACK, COLOR_WHITE, COLOR_BLACK); init_pair(BLACK_WHITE, COLOR_BLACK, COLOR_WHITE); init_pair(RED_BLUE, COLOR_RED, COLOR_BLUE); init_pair(BLACK_BLACK, COLOR_BLACK, COLOR_BLACK); init_pair(BLUE_WHITE, COLOR_BLUE, COLOR_WHITE); memset(position, 0, sizeof(position)); update_xymax(position, 0); update_xymax(position, 1); #if defined(PERF_ENABLED) perf_start(&g.perf, g.pid); #endif for (;;) { int ch, blink_attrs; char cursor_ch; position_t *p = &position[g.view]; addr_t show_addr; float percent; if ((!tick) && (g.view == VIEW_PAGE)) { if ((rc = read_maps(false)) < 0) break; } if ((g.view == VIEW_PAGE) && g.auto_zoom) { const int32_t window_pages = p->xmax * p->ymax; zoom = (g.mem_info.npages + window_pages - 1) / window_pages; zoom = MINIMUM(MAX_ZOOM, zoom); zoom = MAXIMUM(MIN_ZOOM, zoom); } if (g.opt_flags & OPT_FLAG_READ_ALL_PAGES) { read_all_pages(); g.opt_flags &= ~OPT_FLAG_READ_ALL_PAGES; } if (!tick) { int fd; tick = 0; fd = open(g.path_refs, O_RDWR); if (fd > -1) { ret = write(fd, "4", 1); (void)ret; (void)close(fd); } } tick++; if (tick > ticks) tick = 0; /* * SIGWINCH window resize triggered so * handle window resizing in ugly way */ if (g.resized) { int newx, newy; const index_t cursor_index = page_index + zoom * (p->xpos + (p->ypos * p->xmax)); struct winsize ws; if (ioctl(fileno(stdin), TIOCGWINSZ, &ws) < 0) { rc = ERR_RESIZE_FAIL; break; } newy = ws.ws_row; newx = ws.ws_col; /* Way too small, give up */ if ((COLS < 23) || (LINES < 1)) { rc = ERR_SMALL_WIN; break; } resizeterm(newy, newx); wresize(g.mainwin, newy, newx); wrefresh(g.mainwin); refresh(); wbkgd(g.mainwin, COLOR_PAIR(RED_BLUE)); g.resized = false; p->xpos = 0; p->ypos = 0; page_index = cursor_index; } /* * Window getting too small, tell user */ if ((COLS < 80) || (LINES < 23)) { wclear(g.mainwin); wbkgd(g.mainwin, COLOR_PAIR(RED_BLUE)); wattrset(g.mainwin, COLOR_PAIR(WHITE_RED) | A_BOLD); mvwprintw(g.mainwin, LINES / 2, (COLS / 2) - 8, " WINDOW TOO SMALL "); wrefresh(g.mainwin); refresh(); usleep(udelay); continue; } update_xymax(position, g.view); wbkgd(g.mainwin, COLOR_PAIR(RED_BLUE)); show_key(); blink++; if (g.view == VIEW_MEM) { int32_t curxpos = (p->xpos * 3) + ADDR_OFFSET; const position_t *pc = &position[VIEW_PAGE]; const index_t cursor_index = page_index + zoom * (pc->xpos + (pc->ypos * pc->xmax)); percent = (g.mem_info.npages > 0) ? 100.0 * cursor_index / g.mem_info.npages : 100; /* Memory may have shrunk, so check this */ if (cursor_index >= (index_t)g.mem_info.npages) { /* Force end of memory key action */ ch = KEY_END; goto force_ch; } map = g.mem_info.pages[cursor_index].map; show_addr = g.mem_info.pages[cursor_index].addr + data_index + (p->xpos + (p->ypos * p->xmax)); if (show_memory(cursor_index, data_index, p) < 0) break; blink_attrs = A_BOLD | ((blink & BLINK_MASK) ? COLOR_PAIR(WHITE_BLUE) : COLOR_PAIR(BLUE_WHITE)); wattrset(g.mainwin, blink_attrs); cursor_ch = mvwinch(g.mainwin, p->ypos + 1, curxpos) & A_CHARTEXT; mvwprintw(g.mainwin, p->ypos + 1, curxpos, "%c", cursor_ch); blink_attrs = A_BOLD | ((blink & BLINK_MASK) ? COLOR_PAIR(BLACK_WHITE) : COLOR_PAIR(WHITE_BLACK)); curxpos = ADDR_OFFSET + (p->xmax * 3) + p->xpos; wattrset(g.mainwin, blink_attrs); cursor_ch = mvwinch(g.mainwin, p->ypos + 1, curxpos) & A_CHARTEXT; mvwprintw(g.mainwin, p->ypos + 1, curxpos, "%c", cursor_ch); } else { int32_t curxpos = p->xpos + ADDR_OFFSET; const index_t cursor_index = page_index + zoom * (p->xpos + (p->ypos * p->xmax)); percent = (g.mem_info.npages > 0) ? 100.0 * cursor_index / g.mem_info.npages : 100; /* Memory may have shrunk, so check this */ if (cursor_index >= (index_t)g.mem_info.npages) { /* Force end of memory key action */ ch = KEY_END; goto force_ch; } map = g.mem_info.pages[cursor_index].map; show_addr = g.mem_info.pages[cursor_index].addr; show_pages(cursor_index, page_index, p, zoom); blink_attrs = A_BOLD | ((blink & BLINK_MASK) ? COLOR_PAIR(BLACK_WHITE) : COLOR_PAIR(WHITE_BLACK)); wattrset(g.mainwin, blink_attrs); cursor_ch = mvwinch(g.mainwin, p->ypos + 1, curxpos) & A_CHARTEXT; mvwprintw(g.mainwin, p->ypos + 1, curxpos, "%c", cursor_ch); } ch = getch(); if (g.help_view) show_help(); wattrset(g.mainwin, COLOR_PAIR(WHITE_BLUE) | A_BOLD); banner(0); if (!map) { mvwprintw(g.mainwin, 0, 0, "Pagemon 0x---------------- %4.4s x %-3d ", g.auto_zoom && ((blink & BLINK_MASK)) ? "Auto" : "Zoom", zoom); wprintw(g.mainwin, "---- --:-- %-20.20s", "[Not Mapped]"); } else { mvwprintw(g.mainwin, 0, 0, "Pagemon 0x%16.16" PRIx64 " %4.4s x %-3d ", show_addr, g.auto_zoom && ((blink & BLINK_MASK)) ? "Auto" : "Zoom", zoom); wprintw(g.mainwin, "%s %s %-20.20s", map->attr, map->dev, map->name[0] == '\0' ? "[Anonymous]" : basename(map->name)); } mvwprintw(g.mainwin, 0, COLS - 8, " %6.1f%%", percent); wrefresh(g.mainwin); refresh(); force_ch: prev_page_index = page_index; prev_data_index = data_index; p->xpos_prev = p->xpos; p->ypos_prev = p->ypos; switch (ch) { case 27: /* ESC */ case 'q': case 'Q': /* Quit */ g.terminate = true; break; #if defined(PERF_ENABLED) case 'p': case 'P': /* Toggle perf stats */ g.perf_view = !g.perf_view; break; #endif case '\t': /* Toggle Tab view */ g.tab_view = !g.tab_view; break; case 'v': case 'V': /* Toggle VM stats view */ g.vm_view = !g.vm_view; break; case '?': case 'h': /* Toggle Help */ g.help_view = !g.help_view; break; case 'r': case 'R': read_all_pages(); break; case 'a': case 'A': /* Toggle auto zoom */ g.auto_zoom = !g.auto_zoom; break; case '\n': /* Toggle MAP / MEMORY views */ g.view ^= 1; p = &position[g.view]; blink = 0; break; case '+': case 'z': /* Zoom in */ if (g.view == VIEW_PAGE) { zoom++ ; zoom = MINIMUM(MAX_ZOOM, zoom); reset_cursor(p, &data_index, &page_index); } break; case '-': case 'Z': /* Zoom out */ if (g.view == VIEW_PAGE) { zoom--; zoom = MAXIMUM(MIN_ZOOM, zoom); reset_cursor(p, &data_index, &page_index); } break; case '[': /* Reset zoom to MIN_ZOOM */ if (g.view == VIEW_PAGE) { g.auto_zoom = false; zoom = MIN_ZOOM; reset_cursor(p, &data_index, &page_index); } break; case ']': /* Reset zoom to MAX_ZOOM */ if (g.view == VIEW_PAGE) { g.auto_zoom = false; zoom = MAX_ZOOM; reset_cursor(p, &data_index, &page_index); } break; case 't': /* Tick increase */ ticks++; ticks = MINIMUM(MAX_TICKS, ticks); break; case 'T': /* Tick decrease */ ticks--; ticks = MAXIMUM(MIN_TICKS, ticks); break; case 'c': case 'C': /* Clear pop ups */ g.perf_view = false; g.vm_view = false; g.tab_view = false; g.help_view = false; break; case KEY_DOWN: blink = 0; if (g.view == VIEW_PAGE) data_index = 0; p->ypos++; break; case KEY_UP: blink = 0; if (g.view == VIEW_PAGE) data_index = 0; p->ypos--; break; case KEY_LEFT: blink = 0; if (g.view == VIEW_PAGE) data_index = 0; p->xpos--; break; case KEY_RIGHT: blink = 0; if (g.view == VIEW_PAGE) data_index = 0; p->xpos++; break; case KEY_NPAGE: if (g.view == VIEW_PAGE) data_index = 0; blink = 0; p->ypos += p->ymax / 2; break; case KEY_PPAGE: if (g.view == VIEW_PAGE) data_index = 0; blink = 0; p->ypos -= p->ymax / 2; break; case KEY_HOME: reset_cursor(p, &data_index, &page_index); break; case KEY_END: if (g.view == VIEW_PAGE) { page_index = g.mem_info.npages - 1; p->xpos = 0; } else { data_index = g.page_size - ((index_t)p->xmax * p->ymax); } p->ypos = p->ymax - 1; p->xpos = p->xmax - 1; break; } position[VIEW_PAGE].ypos_max = (((g.mem_info.npages - page_index) / zoom) - p->xpos) / position[0].xmax; position[VIEW_MEM].ypos_max = position[VIEW_MEM].ymax; if (p->xpos >= p->xmax) { p->xpos = 0; p->ypos++; } if (p->xpos < 0) { p->xpos = p->xmax - 1; p->ypos--; } /* * Handling yposition overflow / underflow * is non-trivial as we need to consider * different views and how to handle the * scroll data and page index offsets */ if (g.view == VIEW_MEM) { if (p->ypos > p->ymax - 1) { data_index += p->xmax * (p->ypos - (p->ymax - 1)); p->ypos = p->ymax - 1; if (data_index >= g.page_size) { data_index -= g.page_size; page_index++; } } if (p->ypos < 0) { data_index -= p->xmax * (-p->ypos); p->ypos = 0; if (data_index < 0) { data_index += g.page_size; page_index--; } } } else { if (p->ypos > p->ymax - 1) { page_index += zoom * p->xmax * (p->ypos - (p->ymax - 1)); p->ypos = p->ymax - 1; } if (p->ypos < 0) { page_index -= zoom * p->xmax * (-p->ypos); p->ypos = 0; } } if (page_index < 0) { page_index = 0; data_index = 0; p->ypos = 0; } if (g.view == VIEW_MEM) { const position_t *pc = &position[VIEW_PAGE]; const index_t cursor_index = page_index + zoom * (pc->xpos + (pc->ypos * pc->xmax)); const addr_t addr = (cursor_index >= (index_t)g.mem_info.npages) ? g.mem_info.last_addr : g.mem_info.pages[cursor_index].addr + data_index + (p->xpos + (p->ypos * p->xmax)); if (addr >= g.mem_info.last_addr) { page_index = prev_page_index; data_index = prev_data_index; p->xpos = p->xpos_prev; p->ypos = p->ypos_prev; } } else { if ((index_t)page_index + ((index_t)zoom * (p->xpos + (p->ypos * p->xmax))) >= (index_t)g.mem_info.npages) { const int64_t zoom_xmax = (int64_t)zoom * p->xmax; const int64_t lines = ((zoom_xmax - 1) + g.mem_info.npages) / zoom_xmax; const addr_t npages = (zoom_xmax * lines); const addr_t diff = (npages - g.mem_info.npages) / zoom; const int64_t last = p->xmax - diff; if (lines <= p->ymax + 1) { p->ypos = lines - 1; page_index = 0; } else { p->ypos = p->ymax - 1; page_index = (lines - p->ymax) * zoom_xmax; } if (p->xpos > last - 1) p->xpos = last - 1; } } if (g.terminate) break; if (kill(g.pid, 0) < 0) break; usleep(udelay); } werase(g.mainwin); wrefresh(g.mainwin); refresh(); delwin(g.mainwin); terminate: if (g.curses_started) { clear(); endwin(); } #if defined(PERF_ENABLED) perf_stop(&g.perf); #endif free(g.mem_info.pages); ret = EXIT_FAILURE; switch (rc) { case OK: ret = EXIT_SUCCESS; break; case ERR_NO_MAP_INFO: fprintf(stderr, "Cannot access memory maps for PID %d\n", g.pid); break; case ERR_NO_MEM_INFO: fprintf(stderr, "Cannot access memory for PID %d\n", g.pid); break; case ERR_SMALL_WIN: fprintf(stderr, "Window too small\n"); break; case ERR_ALLOC_NOMEM: fprintf(stderr, "Memory allocation failed\n"); break; case ERR_TOO_MANY_PAGES: fprintf(stderr, "Too many pages in process for %s\n", APP_NAME); printf("%" PRIu64 " vs %" PRIu64 "\n", g.mem_info.npages , g.max_pages); break; case ERR_TOO_FEW_PAGES: fprintf(stderr, "Too few pages in process for %s\n", APP_NAME); break; case ERR_RESIZE_FAIL: fprintf(stderr, "Cannot get window size after a resize event\n"); break; case ERR_NO_PROCESS: fprintf(stderr, "Process %d exited\n", g.pid); break; case ERR_FAULT: fprintf(stderr, "Internal error, segmentation fault or bus error\n"); break; default: fprintf(stderr, "Unknown failure (%d)\n", rc); break; } exit(ret); }